UNIT 3 (Chromatic Polynomial)

Pbm: 6
Find the Chromatic polynomial of C6 using Induction Hypothesis Method?
Soln:

---Please Solve----

THEOREM:
Let G be a simple graph, Also G-E and G/E be the graphs obtained by deleting and
contracting an edge e respectively then prove that
PG (K)

PG-E (K)

PG/E (K)

Proof:

Let e = uv be an edge in the graph PG(k)

Such that u and v are not adjacent sides
So that we may assume that K colouring of the vertices (u,v) of graph PG(K) may have same
or different colours
Case 1: (If u and v have different colours) We are not going to combine the vertices
K colouring of G-E is denoted by PG-E (K), which is similar to PG (K)
Hence PG (K) = P G-E (K)

Case 2: (If u and v has different colours) We are going to combine the vertices
Then k colouring of graph PG (K) is denoted by PG/E (K)
Hence total colouring of graph is denoted by PG (K) + PG/E (K)
PG-E (K) = PG (K) + PG/E (K)
Therefore PG (K) = PG-E (K) PG/E (K)

Hence the Proof

Graph Theory & Applications (Issued by CSE Dept. Cape Institute of Tech.) ~Janarish Saju C

11