The Rainbow Vertex-Connection Number of Star Fan Graphs
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. I...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Mathematics Department UIN Maulana Malik Ibrahim Malang
2018-12-01
|
| Series: | Cauchy: Jurnal Matematika Murni dan Aplikasi |
| Subjects: | |
| Online Access: | https://ejournal.uin-malang.ac.id/index.php/Math/article/view/5516 |
| _version_ | 1811337866788208640 |
|---|---|
| author | Ariestha Widyastuty Bustan A.N.M. Salman |
| author_facet | Ariestha Widyastuty Bustan A.N.M. Salman |
| author_sort | Ariestha Widyastuty Bustan |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-13T18:01:17Z |
| format | Article |
| id | doaj.art-ff9dcca415544f1f8380398845ffb84b |
| institution | Directory Open Access Journal |
| issn | 2086-0382 2477-3344 |
| language | English |
| last_indexed | 2024-04-13T18:01:17Z |
| publishDate | 2018-12-01 |
| publisher | Mathematics Department UIN Maulana Malik Ibrahim Malang |
| record_format | Article |
| series | Cauchy: Jurnal Matematika Murni dan Aplikasi |
| spelling | doaj.art-ff9dcca415544f1f8380398845ffb84b2022-12-22T02:36:14ZengMathematics Department UIN Maulana Malik Ibrahim MalangCauchy: Jurnal Matematika Murni dan Aplikasi2086-03822477-33442018-12-015311211610.18860/ca.v5i3.55164070The Rainbow Vertex-Connection Number of Star Fan GraphsAriestha Widyastuty Bustan0A.N.M. Salman1Pasific UniversityPasific UniversityA 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.https://ejournal.uin-malang.ac.id/index.php/Math/article/view/5516graphrainbow vertex-coloringrainbow vertex-connection numberstar fan graphfan |
| spellingShingle | Ariestha Widyastuty Bustan A.N.M. Salman The Rainbow Vertex-Connection Number of Star Fan Graphs Cauchy: Jurnal Matematika Murni dan Aplikasi graph rainbow vertex-coloring rainbow vertex-connection number star fan graph fan |
| title | The Rainbow Vertex-Connection Number of Star Fan Graphs |
| title_full | The Rainbow Vertex-Connection Number of Star Fan Graphs |
| title_fullStr | The Rainbow Vertex-Connection Number of Star Fan Graphs |
| title_full_unstemmed | The Rainbow Vertex-Connection Number of Star Fan Graphs |
| title_short | The Rainbow Vertex-Connection Number of Star Fan Graphs |
| title_sort | rainbow vertex connection number of star fan graphs |
| topic | graph rainbow vertex-coloring rainbow vertex-connection number star fan graph fan |
| url | https://ejournal.uin-malang.ac.id/index.php/Math/article/view/5516 |
| work_keys_str_mv | AT ariesthawidyastutybustan therainbowvertexconnectionnumberofstarfangraphs AT anmsalman therainbowvertexconnectionnumberofstarfangraphs AT ariesthawidyastutybustan rainbowvertexconnectionnumberofstarfangraphs AT anmsalman rainbowvertexconnectionnumberofstarfangraphs |