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...
| Authors: | ; ; |
|---|---|
| Format: | Article |
| Status: | Published version |
| Publication date: | 2024 |
| Country: | España |
| Institution: | Universidad de Sevilla (US) |
| Repository: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/162541 |
| Online Access: | https://hdl.handle.net/11441/162541 https://doi.org/10.2478/auom-2024-0019 |
| Access Level: | Open access |
| Keyword: | b-chromatic number Subdivision-vertex neighbourhood corona Path Cycle Star Complete graphs |
| Summary: | 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. |
|---|