Title of article
Modular colorings of join of two special graphs
Author/Authors
Paramaguru, N. Annamalai University - Directorate of Distance Education - Mathematics Wing, India , Sampathkumar, R. Annamalai University - Faculty of Engineering and Technology - Mathematics Section, India
From page
139
To page
149
Abstract
For k ≥ 2, a modular k-coloring of a graph G without isolated vertices is a coloring of the vertices of G with the elements in Zk having the property that for every two adjacent vertices of G, the sums of the colors of their neighbors are different in Zk . The minimum k for which G has a modular k- coloring is the modular chromatic number of G. In this paper, we determine the modular chromatic number of join of two special graphs.
Keywords
modular coloring , modular chromatic number , join of two graphs
Journal title
Electronic Journal of Graph Theory and Applications (EJGTA)
Journal title
Electronic Journal of Graph Theory and Applications (EJGTA)
Record number
2553675
Link To Document