RAINBOW VERTEX CONNECTION NUMBER OF BULL GRAPH, NET GRAPH, TRIANGULAR LADDER GRAPH, AND COMPOSITION GRAPH (P_n [P_1 ])
Abstract
The rainbow connection was first introduced by Chartrand in 2006 and then in 2009 Krivelevich and Yuster first time introduced the rainbow vertex connection. Let graph be a connected graph. The rainbow vertex-connection is the assignment of color to the vertices of a graph , if every vertex on the graph is connected by a path graph that has interior vertices in different colors. The minimum number of colors from the rainbow vertex coloring in the graph is called rainbow vertex connection number which is denoted . The results of the research are the rainbow vertex connection number of bull graph, net graph, triangular ladder graph, and graph composition (Pn[P1]).
Downloads
References
Dafik, Slamin, and A. Muharromah, “On the (Strong) Rainbow Vertex Connection of Graphs Resulting from Edge Comb Product,” J. Phys. Conf. Ser., vol. 1008, no. 1, 2018, doi: 10.1088/1742-6596/1008/1/012055.
Y. Hou and W. C. Shiu, “The spectrum of the edge corona of two graphs,” Electron. J. Linear Algebr., vol. 20, no. September, pp. 586–594, 2010, doi: 10.13001/1081-3810.1395.
D. B. Nugroho, “Catatan Kuliah (2 sks) MX 324 Pengantar Teori Graf (,” 2008.
G. Chartrand, D. Erwin, P. Zhang, and M. Bohemica, “Mathematica Bohemica Terms of use :,” vol. 127, no. 1, pp. 85–98, 2002.
D. Estetikasari and S. Sy, “On the rainbow connection for some corona graphs,” Appl. Math. Sci., vol. 7, no. 97–100, pp. 4975–4980, 2013, doi: 10.12988/ams.2013.37410.
Y. Caro, A. Lev, Y. Roditty, Z. Tuza, and R. Yuster, “On rainbow connection,” Electron. J. Comb., vol. 15, no. 1 R, pp. 1–13, 2008, doi: 10.37236/781.
M. Krivelevich and R. Yuster, “The rainbow connection of a graph is (at most) reciprocal to its minimum degree,” J. Graph Theory, vol. 63, no. 3, pp. 185–191, 2010, doi: 10.1002/jgt.20418.
P. Heggernes, D. Issac, J. Lauri, P. T. Lima, and E. J. Van Leeuwen, “Rainbow vertex coloring bipartite graphs and chordal graphs,” Leibniz Int. Proc. Informatics, LIPIcs, vol. 117, no. 83, pp. 1–13, 2018, doi: 10.4230/LIPIcs.MFCS.2018.83.
X. Li and Y. Shi, “On the rainbow vertex-connection 1,” vol. 33, pp. 307–313, 2013, doi: 10.7151/dmgt.1664.
X. Li and S. Liu, “Rainbow vertex-connection number of 2-connected graphs ∗,” no. 11071130, pp. 1–10.
H. Lei, S. Li, H. Liu, and Y. Shi, “Rainbow vertex connection of digraphs,” J. Comb. Optim., vol. 35, no. 1, pp. 86–107, 2018, doi: 10.1007/s10878-017-0156-7.
J. Ekstein et al., “The rainbow connection number of 2-connected graphs,” Discrete Math., vol. 313, no. 19, pp. 1884–1892, 2013, doi: 10.1016/j.disc.2012.04.022.
K. Munawaroh, A. I. Kristiana, E. R. Albirri, D. Dafik, and R. Adawiyah, “Pewarnaan Titik Ketakteraturan Lokal pada Keluarga Graf Unicyclic,” Cgant J. Math. Appl., vol. 2, no. 2, pp. 6–21, 2022, doi: 10.25037/cgantjma.v2i2.59.
N. Azahra, “Pewarnaan Titik Ketakteraturan Lokal pada Keluarga Graf Grid dan Keterkaitannya dengan Keterampilan Berpikir Tingkat Tinggi,” 2020.
A. Muharromah, “On the ( Strong ) Rainbow Vertex Connection of Graphs Resulting from Edge Comb Product” 2018.
Copyright (c) 2024 Muhammad Ilham Nurfaizi Annadhifi, Robiatul Adawiyah, Dafik Dafik, I Nengah Suparta
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
Authors who publish with this Journal agree to the following terms:
- Author retain copyright and grant the journal right of first publication with the work simultaneously licensed under a creative commons attribution license that allow others to share the work within an acknowledgement of the work’s authorship and initial publication of this journal.
- Authors are able to enter into separate, additional contractual arrangement for the non-exclusive distribution of the journal’s published version of the work (e.g. acknowledgement of its initial publication in this journal).
- Authors are permitted and encouraged to post their work online (e.g. in institutional repositories or on their websites) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published works.