On J-colorability of certain derived graph classes-Reference-Cited by-同舟云学术

On J-colorability of certain derived graph classes

Published:2019-12-01 Issue:2 Volume:11 Page:159-173
ISSN:2066-7760
Container-title:Acta Universitatis Sapientiae, Informatica
language:en
Short-container-title:

Author:

Fornasiero Federico¹,Naduvath Sudev²

Affiliation:

1. Department of Mathemathics , Universidade Federal de Pernambuco Recife , Pernambuco, Brazil

2. Department of Mathematics , CHRIST (Deemed to be University) Bangalore - 560029 , India .

Abstract

Abstract A vertex v of a given graph G is said to be in a rainbow neighbourhood of G, with respect to a proper coloring C of G, if the closed neighbourhood N[v] of the vertex v consists of at least one vertex from every color class of G with respect to C. A maximal proper coloring of a graph G is a J-coloring of G such that every vertex of G belongs to a rainbow neighbourhood of G. In this paper, we study certain parameters related to J-coloring of certain Mycielski-type graphs.

Publisher

Walter de Gruyter GmbH

Link

https://www.sciendo.com/pdf/10.2478/ausi-2019-0011

Reference16 articles.

1. [1] J.A. Bondy, U.S.R. Murty, Graph theory, Springer, Berlin, 2008. ⇒15910.1007/978-1-84628-970-5

2. [2] G. Chartrand, P. Zhang, Chromatic graph theory, CRC Press, Bocca Raton, 2009. ⇒15910.1201/9781584888017

3. [3] F. Harary, Graph theory, Narosa Publishing House, New Delhi, 2001. ⇒159

4. [4] T. R. Jensen, B. Toft, Graph coloring problems, John Wiley & Sons, 1995. ⇒15910.1002/9781118032497

5. [5] J. Kok, N. K. Sudev, U. Mary, On chromatic Zagreb indices of certain graphs, Discrete Math. Algorithm. Appl., 9, 1 (2017) 1750014:1–14, DOI: 10.1142/S1793830917500148. ⇒16110.1142/S1793830917500148

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On equitable near-proper coloring of some derived graph classes;Carpathian Mathematical Publications;2022-12-30

2. On Equitable Near Proper Coloring of Mycielski Graph of Graphs;Data Science and Security;2021