Modular colorings of join of two special graphs
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-colo...
Main Authors: | N Paramaguru, R Sampathkumar |
---|---|
Format: | Article |
Language: | English |
Published: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2014-10-01
|
Series: | Electronic Journal of Graph Theory and Applications |
Subjects: | |
Online Access: | https://www.ejgta.org/index.php/ejgta/article/view/28 |
Similar Items
-
On Closed Modular Colorings of Trees
by: Phinezy Bryan, et al.
Published: (2013-05-01) -
The Local Antimagic Chromatic Numbers of Some Join Graphs
by: Xue Yang, et al.
Published: (2021-11-01) -
On incidence coloring of graph fractional powers
by: Mahsa Mozafari-Nia, et al.
Published: (2022-12-01) -
M2-Edge Colorings Of Cacti And Graph Joins
by: Czap Július, et al.
Published: (2016-02-01) -
On Coloring Catalan Number Distance Graphs and Interference Graphs
by: Venkataraman Yegnanarayanan, et al.
Published: (2018-10-01)