Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2302.13667 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914084471963648 |
|---|---|
| author | Falcón, Raúl M. Venkatachalam, M. Margaret, S. Julie |
| author_facet | Falcón, Raúl M. Venkatachalam, M. Margaret, S. Julie |
| contents | 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\boxdot H$ or $G\boxdot K_n$, where $K_n$ is the complete graph of order $n$. It is also established for those graphs $K_n\boxdot G$ having $m$-degree not greater than $n+2$. All the proofs are accompanied by illustrative examples. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2302_13667 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Determining the b-chromatic number of subdivision-vertex neighbourhood coronas Falcón, Raúl M. Venkatachalam, M. Margaret, S. Julie Combinatorics 05C15 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\boxdot H$ or $G\boxdot K_n$, where $K_n$ is the complete graph of order $n$. It is also established for those graphs $K_n\boxdot G$ having $m$-degree not greater than $n+2$. All the proofs are accompanied by illustrative examples. |
| title | Determining the b-chromatic number of subdivision-vertex neighbourhood coronas |
| topic | Combinatorics 05C15 |
| url | https://arxiv.org/abs/2302.13667 |