Vol. 22 No. Special Issue (2023): Mapana Journal of Sciences- RECENT DEVELOPMENTS IN PURE AND APPLIED MATHEMATICS
Research Articles

Sigma Chromatic Number of Some Graphs

Preethi K Pillai
NSS Hindu College, Changanacherry

Published 2023-07-19

Keywords

  • σ− coloring,
  • Sigma Chromatic number,
  • Barbell Graph,
  • Twig graph,
  • Shell graph,
  • Tadpole,
  • Lollipop
  • ...More
    Less

Abstract

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.

References

  1. Gallian J.A, “ Survey of Graph labelling”, The Electronic Journal
  2. of Combinatorics, (2012)
  3. G. Chartrand and P.Zhang, “Chromatic Graph Theory”, Boca Raton,
  4. Chapman and amp; Hall Press, (2008).
  5. Gary Chartrand, “Futaba Okamoto, Ping Zhang”, The Sigma Chromatic Number of a Graph, Graphs and Combinatorics , vol 26, pp.755-–773, 2010.
  6. Harary Frank, “Graph Theory”, Addison Wesley, Reading Mass, 1969.
  7. 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.
  8. 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.