Determining the b-chromatic number of subdivision-vertex neighbourhood coronas
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 G H or G Kn, where Kn is the complete graph of order n. It is also established for those graphs Kn G having m-degree not gr...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2024 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/162541 |
| Acceso en línea: | https://hdl.handle.net/11441/162541 https://doi.org/10.2478/auom-2024-0019 |
| Access Level: | acceso abierto |
| Palabra clave: | b-chromatic number Subdivision-vertex neighbourhood corona Path Cycle Star Complete graphs |
| Sumario: | 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 G H or G Kn, where Kn is the complete graph of order n. It is also established for those graphs Kn G having m-degree not greater than n + 2. All the proofs are accompanied by illustrative examples. |
|---|