A Study on Comb Graph Product in Equitable Coloring
Keywords:
Equitable Coloring; Comb Product; Path graph; Cycle GraphComplete GraphAbstract
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
Published
2025-06-17
Issue
Section
Articles