Chromatic polynomials of some nanostars

Document Type: Research Paper

Authors

1 Yazd University, Iran

2 Yazd University, Yazd, Iran

Abstract

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.

Keywords