Let G be a disconnected simple graph Prove that the chromati

Let G be a disconnected simple graph. Prove that the chromatic polynomial P_G(k) of G is the product of the chromatic polynomials of the components of G. What can you say about the degree of the lowest non-vanishing term of P_G(k)?

Solution

import java.util.Scanner;

/** category GraphColoring **/
public category GraphColoring
non-public int V, numOfColors;
personal int[] color;
personal int[][] graph;

/** perform to assign color **/
public void graphColor(int[][] g, int noc)
resolution found **/
if (v == V)
throw new Exception(\"Solution found\");
/** attempt all colors **/
for (int c = 1; c <= numOfColors; c++)
  
}
}
/** perform to visualize if it\'s valid to allot that color to vertex **/
public Boolean isPossible(int v, int c)
one && c == color[i])
come false;
come true;
}
/** show answer **/
public void display()