Rainbow vertex connection number and strong rainbow vertex connection number on slinky graph (SlnC4))
A graph is said rainbow connected if no path has more than one vertices of the same color inside. The minimum number of colors required to make a graph to be rainbow vertex-connected is called rainbow vertex connection-number and denoted by rvc(G) . Meanwhile, the minimum number of colors required...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | Indonesian |
| Published: |
Universitas Islam Negeri Raden Intan Lampung
2021-07-01
|
| Series: | Desimal |
| Subjects: | |
| Online Access: | http://ejournal.radenintan.ac.id/index.php/desimal/article/view/7276 |