Warning: count(): Parameter must be an array or an object that implements Countable in /home/customer/www/thegatebook.in/public_html/qa/qa-include/qa-theme-base.php on line 177

# DM - Grand Test -Q12

Warning: count(): Parameter must be an array or an object that implements Countable in /home/customer/www/thegatebook.in/public_html/qa/qa-include/qa-theme-base.php on line 177
+1 vote

Let $\dpi{100} K_{A,B}$ be the complete bipartite graph with A and B being the two parts, and let |A| = 10, |B| = 17, and Let u, v $\dpi{100} \in$ A be two different vertices in A part, Add to $\dpi{100} K_{A,B}$ a new edge by making u and v adjacent to get a new graph G. The chromatic number of this new Graph G is ________?

reshown Aug 31, 2020