arXiv Analytics

Sign in

arXiv:1712.02324 [math.GM]AbstractReferencesReviewsResources

On the Rainbow Neighbourhood Number of Set-Graphs

Johan Kok, Sudev Naduvath

Published 2017-12-06Version 1

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.

Related articles:
arXiv:1710.00383 [math.GM] (Published 2017-10-01)
Reflection on rainbow neighbourhood numbers of graphs
arXiv:1612.04194 [math.GM] (Published 2016-12-11)
A Note on Johan Colouring of Graphs
arXiv:1703.01089 [math.GM] (Published 2017-03-03)
Rainbow Neighbourhoods of Graphs