2016/12/11 by Sudev Naduvath, Naduvath, Sudev
Computer Science · Engineering · #05C15 #Advanced Graph Theory Research #FOS: Mathematics #General Mathematics (math.GM) #Graph Labeling and Dimension Problems #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1612.04194
openalex publication_date 2016/12/11 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this paper, a new type of colouring called Johan colouring is introduced. This colouring concept is motivated by the newly introduced invariant called the rainbow neighbourhood number of a graph. The study ponders on maximal colouring opposed to minimum colouring. An upper bound for a connected graph is presented and a number of explicit results are presented for cycles, complete graphs, wheel graphs and for a complete l-partite graph.