00:01
Hello everyone, in this video we have to find the chromatic polynomial of the graph below.
00:05
Let us take this graph g and name the vertices a, b, c and d, e.
00:15
Okay so it's the given the graph g.
00:23
We are asked to find the chromatic number.
00:37
So chromatic number is the number of colors by which we can color the graph such that no adjacent edges have same color.
00:45
For example, if this example only if a, b is a graph, the chromatic number for this graph is 2.
01:06
So from here we see that if a graph is a cycle of even edges then it can be colored by two colors and if it is a cycle of odd edges then it can be colored by three colors and chromatic of a complete graph kn, sn as all the edges are connected to each other.
01:23
So we color all the vertices with different colors.
01:27
So from the given graph if we delete the edge and contract we get so we get this graph.
02:00
So here a, b, c, sorry e and sorry d, c...