2017/12/06 by Johan Kok, Sudev Naduvath, Kok, Johan +1
Computer Science · Mathematics · #05C15 #05C38 #05C75 #05C85 #Advanced Graph Theory Research #FOS: Mathematics #General Mathematics (math.GM) #Graph Labeling and Dimension Problems #Limits and Structures in Graph Theory
paper · pdf · doi:10.48550/arxiv.1712.02324
openalex publication_date 2017/12/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.