Sigma Chromatic Number of Some Graphs


  • Preethi K Pillai NSS Hindu College, Changanacherry
  • J Suresh Kumar



σ− coloring, Sigma Chromatic number, Barbell Graph, Twig graph, Shell graph, Tadpole, Lollipop


The Sigma coloring  of a graph G with n vertices is an injection from V(G) to {1,2,3...,n}  such that the color sums (adding  the colors of the neighbouring vertices) of any two neighbouring vertices are different. The smallest number  of  colours  needed  to color a graph G  is represented by its Sigma Chromatic number. In this article  we obtain the sigma -coloring of some graphs such as Barbell Graph, Twig graph, Shell graph,Tadpole, Lollipop, Fusing all the vertices of cycle and duplication of every edge by a vertex in cycle.


Gallian J.A, “ Survey of Graph labelling”, The Electronic Journal

of Combinatorics, (2012)

G. Chartrand and P.Zhang, “Chromatic Graph Theory”, Boca Raton,

Chapman and amp; Hall Press, (2008).

Gary Chartrand, “Futaba Okamoto, Ping Zhang”, The Sigma Chromatic Number of a Graph, Graphs and Combinatorics , vol 26, pp.755-–773, 2010.

Harary Frank, “Graph Theory”, Addison Wesley, Reading Mass, 1969.

J. Suresh Kumar, “Graph Coloring Parameters–A survey”, International Journal for Research in Applied Science and Engineering Technology,Vol 7 ,no.4,April ,pp.153–156,2019.

J. Suresh Kumar,Preethi K Pillai, “Sigma coloring and Graph Operations”, South East Asian J.of Mathematics and Mathematical Sciences, Vol.17,no.3, December,pp.363–372, 2021.

Additional Files