On the rainbow neighbourhood number of set-graphs
Abstract
In this paper, we present results for the rainbow neighbourhood numbers of set-graphs. It is also shown that set-graphs are perfect graphs. The intuitive colouring dilemma in respect of the rainbow neighbourhood convention is clarified as well. Finally, the new notion of the maximax independence, maximum proper colouring of a graph and a new graph parameter called the i-max number of G are introduced as a new research direction.
Copyright © 2020 Johan Kok, Sudev Naduvath. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Cite this article
J. Kok, S. Naduvath, On the rainbow neighbourhood number of set-graphs, J. Math. Comput. Sci. 10 (2020), 394–402. https://doi.org/10.28919/jmcs/4374
BibTeX
@article{Kok2020,
author = {Kok, Johan and Naduvath, Sudev},
title = {On the rainbow neighbourhood number of set-graphs},
journal = {J. Math. Comput. Sci.},
volume = {10},
year = {2020},
pages = {394--402},
doi = {10.28919/jmcs/4374}
}