P. Sumathi

Modular chromatic number on inflated graphs of some tree graphs

P. Sumathi, S. Tamilselvi

In this paper: For any graph G(V, E), V(G) is the vertex set and E(G) is the edge set. Let the vertex coloring be called modular coloring mc (G) of G if any two adjacent vertices receive different color sums, that i...