On Certain J-Colouring Parameters of Graphs

Title

On Certain J-Colouring Parameters of Graphs

Creator

Naduvath S.

Description

In this paper, a new type of colouring called J-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. 2019, The National Academy of Sciences, India.

Source

National Academy Science Letters, Vol-43, No. 1, pp. 53-57.

Date

2020-01-01

Publisher

Springer

Subject

J-colouring; J-colouring mean; J-colouring number; J-colouring variance

Coverage

Naduvath S., Department of Mathematics, CHRIST (Deemed to be University), Bengaluru, 560029, Karnataka, India

Rights

All Open Access; Green Open Access

Relation

ISSN: 0250541X

Format

Online

Language

English

Type

Article

Identifier

https://doi.org/10.1007/s40009-019-00805-1

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85069860865&doi=10.1007%2fs40009-019-00805-1&partnerID=40&md5=dde799b98ad8b09aeb99aa24a8d39e9b