THE RAINBOW VERTEX-CONNECTION NUMBERS OF WHEEL-SHIELD GRAPHS
Let be a nontrivial simple connected graph, be an edge of and be an integer greater than or equal to . A path of order , denoted by , is a graph whose vertices can be labelled such that . A -shield graph is a graph obtained by and copies of such that the edge of -th embedded to -th edge of...
Guardat en:
| Autors principals: | , |
|---|---|
| Format: | Artigo |
| Idioma: | Inglês |
| Publicat: |
Universitas Pattimura
2025-09-01
|
| Col·lecció: | Barekeng |
| Matèries: | |
| Accés en línia: | https://ojs3.unpatti.ac.id/index.php/barekeng/article/view/16714 |
| Etiquetes: |
Sense etiquetes, Sigues el primer a etiquetar aquest registre!
|