International Journal For Multidisciplinary Research

E-ISSN: 2582-2160     Impact Factor: 9.24

A Widely Indexed Open Access Peer Reviewed Multidisciplinary Bi-monthly Scholarly International Journal

Call for Paper Volume 7, Issue 2 (March-April 2025) Submit your research before last 3 days of April to publish your research paper in the issue of March-April.

Johan Coloring of Neighbourhood Corona of Graphs

Author(s) S.Florence Poornima, A. Arokia Lancy
Country India
Abstract Johan coloring or J-Coloring is the proper vertex coloring in which every vertices of a graph should belongs to rainbow neighbourhood . In a given graph G, a vertex v is said to be rainbow neighbourhood if every color class of G consists of atleast of one vertex of G from the closed neighbourhood. The Neighbourhood Corona is obtained by taking one copy of G1 and n1 copies of G2 and by joining each neighbour ith copy of G1 to each and every vertex of ith copy of G2. In this paper we determine Johan Chromatic number of Neighbourhood Coronna of Graphs.
Keywords Neighbourhood Corona, Johan Coloring, Johan Chromatic Number.
Field Mathematics
Published In Volume 7, Issue 1, January-February 2025
Published On 2025-01-04
DOI https://doi.org/10.36948/ijfmr.2025.v07i01.34254
Short DOI https://doi.org/g82hj2

Share this