CHROMATIC POLYNOMIALS OF SOME NANOSTARS
Saeid Alikhani, Iranmanesh · Iranian journal of mathemathical chemistry./Iranian journal of mathemathical chemistry · 2012
Let G be a simple graph and ) , G ( denotes the number of proper vertex colourings of G with at most colours, which is for a fixed graph G , a polynomial in , which is called the chromatic polynomial of G . Using the chromatic polynomial of some specific graphs, we obtain the chromatic polynomials of some nanostars.