Modular colorings of join of two special graphs | Zendy

N. Paramaguru | Zendy; R. Sampathkumar | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Modular colorings of join of two special graphs

Author(s) -

N. Paramaguru,

R. Sampathkumar

Publication year - 2014

Publication title -

electronic journal of graph theory and applications

Language(s) - English

Resource type - Journals

ISSN - 2338-2287

DOI - 10.5614/ejgta.2014.2.2.6

Subject(s) - combinatorics , join (topology) , modular design , chromatic scale , mathematics , graph , edge coloring , complete coloring , discrete mathematics , computer science , graph power , line graph , operating system

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research