1 votes 1 votes What is the chromatic number of Kn - e (complete graph with an edge removed)? Set Theory & Algebra engineering-mathematics set-theory&algebra + – Mojo-Jojo asked Jan 2, 2016 Mojo-Jojo 1.6k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes look if a graph is not complete then chromatic no is dmax.means higest degree of that graph. u can check it for k4 and others. so if we remove an edge from kn.then chromatic no is n-1. resuscitate answered Jan 2, 2016 • selected Jan 2, 2016 by Mojo-Jojo resuscitate comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes (n-1) bahirNaik answered Jan 2, 2016 bahirNaik comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes n-1 where n is nodes. in complete every1 is adjacent to each other. so we require n colours. but removal of any edge causes one less adjacency.so N-1 viv696 answered Jan 2, 2016 viv696 comment Share Follow See all 0 reply Please log in or register to add a comment.