562 views
0 votes
0 votes
find the values (k tuple coloring )

1)$X_{2}(K_{3}) 2. X_{3}(K_{5})$

1 Answer

Best answer
2 votes
2 votes

k- tuple coloring of a graph G is an assignment of a set of k different colors to each of the vertices of G such that no two adjacent vertices are assigned a common color.We de-note by χk(G)the smallest positive integer n such that G has a k- tuple coloring using n colors.

1)X2(K3)

To see this, note that using only six colors we can assign two colors to each vertex of K3, so that no two adjacent vertices are assigned the same color.

same procedure u will do for next

selected by

Related questions

0 votes
0 votes
1 answer
1
BASANT KUMAR asked Oct 20, 2018
509 views
Q.1) for which value of n are these graph are bipartite??a)$C_{N}$ (cycle graph having "n" vertices)(b) $W_{N}$ (wheel graph having "n" vertices)
3 votes
3 votes
3 answers
2
rahul sharma 5 asked Jun 12, 2017
1,911 views
What are the chromatic number of following graphs?Answer is 6 and 4 respectively.But i am getting 3 for both.Please someone confirm this?
0 votes
0 votes
1 answer
3
Mk Utkarsh asked Mar 1, 2018
526 views
Show that an edge in a simple graph is a cut edge if and only if this edge is not a part of any simple circuit in the graph.
1 votes
1 votes
1 answer
4