Rainbow neighbourhood number of graphs

DOI10.22199/ISSN.0717-6279-2019-03-0030MaRDI QIDQ3295009zbMATH OpenOpenAlexFDO

Authors Johan Kok, N. K. Sudev, Muhammad Jamil

Publication date 30 June 2020

Published in Proyecciones (Antofagasta) (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1703.01089

zbMATH Keywords

colour classescolour clusterrainbow neighbourhood\(v\)-cliqueexpanded line graph

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)

Abstract: In this paper, we introduce the notion of the rainbow neighbourhood and a related graph parameter namely, the rainbow neighbourhood number of a graph $G$. We report on preliminary results thereof. We also establish a necessary and sufficient condition for the existence of a rainbow neighbourhood in the line graph of a graph $G$.

Recommendations

• Neighborhood-rainbow colorings of graphs
• Generalisation of the rainbow neighbourhood number and \(k\)-jump colouring of a graph
• scientific article; zbMATH DE number 1867241
• On \(J\)-colorability of certain derived graph classes
• \(J\)-coloring of graph operations

Cites work

• scientific article; zbMATH DE number 2131198 (Why is no real title available?)
• scientific article; zbMATH DE number 821271 (Why is no real title available?)
• scientific article; zbMATH DE number 3043302 (Why is no real title available?)
• An upper bound for the chromatic number of line graphs
• Chromatic graph theory
• Generalised colouring sums of graphs
• Graph Colorings
• Graph theory with applications
• Methods of destroying the symmetries of a graph
• On the connection between chromatic number, maximal clique and minimal degree of a graph
• The \(b\)-chromatic number of certain graphs and digraphs

Cited in

(10)

• Neighborhood-rainbow colorings of graphs
• A note on \(J\)-colouring of Jahangir graphs
• On \(J\)-colorability of certain derived graph classes
• \(J\)-coloring of graph operations
• Generalisation of the rainbow neighbourhood number and \(k\)-jump colouring of a graph
• Rainbow graphs and semigroups
• Equating two maximum degrees
• Coloring in graphs of twist knots
• Open neighbourhood colouring of some path related graphs
• Coloring of non-zero component graphs

This page was built for publication: Rainbow neighbourhood number of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3295009)