Modular Chromatic Number of Snow Graphs of Some Cycle Related Graph and Its Extended Snow Graph

Authors

  • P. Sumathi Department of Mathematics, C. Kandaswami Naidu College for Men,University of Madras Anna Nagar, Chennai 600 102,Tamilnadu, India https://orcid.org/0009-0005-3174-762X
  • S.Tamilselvi Department of Mathematics, School of Arts and Science, Vinayaka mission’s Chennai Campus, Vinayaka mission’s research foundation(Deemed to be University), Chennai 603104, Tamilnadu, India https://orcid.org/0009-0005-3174-762X

Keywords:

Snow graph, extended snow graph, wheel graph, gear graph, friendship graph, generalized fan graph, flower graph.

Abstract

For a graph mceclip0-aa44b8b2460833ff61c960b893f9c0f7.png a coloring mceclip1-a18a7f4181f7ee99956ad9aef1962a79.png,  (not a proper coloring) called the modular coloring if for each pair of neighboring vertices mceclip2-a32b605d496e90fa977810a332771e0a.png The minimum  for which  has an modular mceclip3-65f79a64cc2cb69384e879be1c878660.png coloring is called modular chromatic number of G. The modular - coloring of a graph is denoted by mceclip4-129801c1e2fd5c9fd4f9eccc21be7d19.pngIn this study we examine the modular chromatic number for some snow graph and extended snow graph of cycle related graph.

Downloads

Published

2024-09-10

How to Cite

P. Sumathi, & S.Tamilselvi. (2024). Modular Chromatic Number of Snow Graphs of Some Cycle Related Graph and Its Extended Snow Graph. Journal of Computational Analysis and Applications (JoCAAA), 33(05), 11–22. Retrieved from https://eudoxuspress.com/index.php/pub/article/view/420

Issue

Section

Articles