srestha yes the graph you told have chromatic number 3 which fits the theorem above because it consists odd cycle.

Dark Mode

856 views

0 votes

srestha yes the graph you told have chromatic number 3 which fits the theorem above because it consists odd cycle.

0

so basically just by knowing k+1 chromatic number and k-regular one cannot identify the number of edges?

because

2-regular graph with 3 vertices have chromatic number 3 and have 3 edges whereas

2-regular graph with 5 vertices have chromatic number 3 and have 5 edges

but if know the vertices then there can be a formula depending on the graph is complete or not complete and contains a odd cycle

because

2-regular graph with 3 vertices have chromatic number 3 and have 3 edges whereas

2-regular graph with 5 vertices have chromatic number 3 and have 5 edges

but if know the vertices then there can be a formula depending on the graph is complete or not complete and contains a odd cycle

2