The Rainbow Vertex-Connection Number of Star Fan Graphs
| Autor: | Ariestha Widyastuty Bustan, A.N.M. Salman |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2018 |
| Předmět: | |
| Zdroj: | Cauchy: Jurnal Matematika Murni dan Aplikasi, Vol 5, Iss 3, Pp 112-116 (2018) |
| Druh dokumentu: | article |
| ISSN: | 2086-0382 2477-3344 |
| DOI: | 10.18860/ca.v5i3.5516 |
| Popis: | A vertex-colored graph is said to be rainbow vertex-connected, if for every two vertices and in , there exists a path with all internal vertices have distinct colors. The rainbow vertex connection number of , denoted by is the smallest number of colors needed to make rainbow vertex connected. In this paper, we determine the rainbow vertex connection number of star fan graphs. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|