Determining the b-chromatic number of subdivision-vertex neighbourhood coronas

MaRDI QIDQ6427748zbMATH OpenFDO

Authors Raúl M. Falcón, Venkatachalam, S. Julie Margaret

Publication date 27 February 2023

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Abstract: Let $G$ and $H$ be two graphs, each one of them being a path, a cycle or a star. In this paper, we determine the $b$-chromatic number of every subdivision-vertex neighbourhood corona $$ or $$, where $K_n$ is the complete graph of order $n$. It is also established for those graphs $$ having $m$-degree not greater than $n+2$. All the proofs are accompanied by illustrative examples.

This page was built for publication: Determining the b-chromatic number of subdivision-vertex neighbourhood coronas

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