Have a personal or library account? Click to login
Determining the b-chromatic number of subdivision-vertex neighbourhood coronas Cover

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

Open Access
|Jul 2024

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 GH or GKn, where Kn is the complete graph of order n. It is also established for those graphs KnG having m-degree not greater than n + 2. All the proofs are accompanied by illustrative examples.

DOI: https://doi.org/10.2478/auom-2024-0019 | Journal eISSN: 1844-0835 | Journal ISSN: 1224-1784
Language: English
Page range: 53 - 84
Submitted on: Feb 27, 2023
Accepted on: Jul 11, 2023
Published on: Jul 10, 2024
Published by: Ovidius University of Constanta
In partnership with: Paradigm Publishing Services
Publication frequency: 3 issues per year

© 2024 Raúl M. Falcón, M. Venkatachalam, S. Julie Margaret, published by Ovidius University of Constanta
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.