Metrics

  • visibility 161 views
  • get_app 80 downloads
description Journal article public Electronic Journal of Graph Theory and Applications

Modular Colorings of Join of Two Special Graphs

N. Paramaguru, R. Sampathkumar
Published 2014

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.

Full text

 

Metrics

  • visibility 161 views
  • get_app 80 downloads