A Study on Comb Graph Product in Equitable Coloring

Authors

  • Barani M Department of Mathematics, Kongunadu Arts and Science College, Coimbatore - 641 029, Tamil Nadu, India.
  • Venkatachalam M Department of Mathematics, Kongunadu Arts and Science College, Coimbatore - 641 029, Tamil Nadu, India.

Keywords:

Equitable Coloring; Comb Product; Path graph; Cycle GraphComplete Graph

Abstract

If the vertices of a graph M are colored with h colors such that no two adjacent points receive same color and the absolute
difference between any two color class is either 0 or 1, then M is said to be equitably h−colorable. And the minimum integer
h is referred as equitable chromatic number of M . The objective of this paper is to caluclate the equitable chromatic
number of comb product between the graphs path, cycle and complete graph.

Downloads

Download data is not yet available.

Downloads

Published

2025-06-17

How to Cite

M, B., & M, V. (2025). A Study on Comb Graph Product in Equitable Coloring. International Journal of Open Problems in Computer Science and Mathematics, 18(3), 83–94. Retrieved from https://ijopcm.icsrs.uk/index.php/journal/article/view/31

Issue

Vol. 18 No. 3 (2025): Int. J. Open Problems Compt. Math., Vol. 18, No. 3, September 2025

Section

Articles