366 views

1 Answer

0 votes
0 votes
I am getting B as the ans...216

as we have exactly 4! way to colour EFGH.....since the degree of each node is 4.....now consider any 1 exterior point ...take A we can colour it in 3 possible way......now corresponding to A we can colour remaining 3 exterior vertice in 3 ways......so ans will be 4!*3*3=216

Related questions

1 votes
1 votes
1 answer
1
rahul sharma 5 asked Nov 16, 2017
2,878 views
Number of subgraphs possible with K4? Given answer is 106 .I think 112 is correct?
9 votes
9 votes
2 answers
2
3 votes
3 votes
3 answers
3
rahul sharma 5 asked Jun 12, 2017
1,963 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?
3 votes
3 votes
1 answer
4
rahul sharma 5 asked Jun 7, 2017
1,300 views
What is the vertex connectivity and edge connectivity of complete graph?Is it n or n-1?