Asimple graph is called regular if every vertex of this graph has the same degree. a regular graph is called n-regular if every vertex in this graph has degree n. recall that kn is the complete graphs with n vertices. and km, n is the complete bipartite graph (see the definition in the book). (a) is kn regular? what �s the chromatic number of kn? (b) for which values of in and n graph km, n is regular? what is the chromatic number of km, n? (c) how many vertices does a 4-regular graph with 10 edges have?