On the Rainbow Neighbourhood Number of Set-Graphs
From MaRDI portal
Publication:6294933
arXiv1712.02324MaRDI QIDQ6294933
Author name not available (Why is that?)
Publication date: 6 December 2017
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 -max number of are introduced as a new research direction.
No records found.
This page was built for publication: On the Rainbow Neighbourhood Number of Set-Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6294933)