On the rainbow vertex connection number of general unicyclic graphs
*Ridho AlfarisiCorresponding authoralfarisi.fkip@unej.ac.idDepartment of Mathematics University of JemberJember, Jember, 68121, IndoensiaView full profile → , Arika Indah Kristianaarika.fkip@unej.ac.idDepartment of Mathematics Education University of JemberJember, Jember, 68121, IndoensiaView full profile → , Sharifah Kartini Said Husainkartini@upm.edu.myDepartment of Mathematics and Statistics Universiti Putra Malaysia; Institute for Mathematical Research Universiti Putra MalaysiaDepartment of Mathematics and Statistics Universiti Putra MalaysiaSerdang Selangor, 43400, MalaysiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 Apr 2025
- Published Online:
- 23 Mar 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-2599
- Pages:
- 1823–1832
Abstract
Keywords
Subject Classifications
References
[1] N. Hartsfield and G. Ringel, Pearls in Graph Theory: A Comprehensive Introduction. Mineola, NY, USA: Courier Corporation (2013).
[2] X. Li and Y. Sun, Rainbow Connections of Graphs. New York, NY, USA: Springer (2012).
[3] G. Chartrand, L. Johns, K. A. McKeon, and P. Zhang, “Rainbow connection in graphs,” Math. Bohem., vol. 133, pp. 85–98 (2008).
[4] 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 (2009).
[5] X. Li and S. Liu, “Rainbow vertex-connection number of 2-connected graphs,” arXiv preprint, arXiv:1110.5770 [math.CO] (2011).
[6] D. N. Simamora and A. N. M. Salman, “The rainbow (vertex) connection number of pencil graphs,” Procedia Comput. Sci., vol. 74, pp. 138–142 (2015).
[7] A. W. Bustan and A. N. M. Salman, “The rainbow vertex-connection number of star fan graphs,” CAUCHY: Jurnal Matematika Murni dan Aplikasi, vol. 5, no. 3, pp. 112–116 (2018).
[8] P. Heggernes, D. Issac, J. Lauri, P. T. Lima, and E. J. van Leeuwen, “Rainbow vertex coloring of bipartite graphs and chordal graphs,” in Proc. 43rd Int. Symp. Mathematical Foundations of Computer Science (MFCS) (2018).
[9] L. Chen, X. Li, and Y. Shi, “The complexity of determining the rainbow vertex-connection of a graph,” Theor. Comput. Sci., vol. 412, pp. 4531–4535 (2011).
[10] T. Zhou, T. Lin, Z. Miao, and L. Lianying, “The extremal Sombor index of trees and unicyclic graphs with given matching number,” J. Discrete Math. Sci. Cryptography, vol. 26, pp. 1–12 (2022).
[11] S. Javed and A. S. M. Javaid, “Extremal unicyclic graphs with fixed leaves via Sombor index,” J. Discrete Math. Sci. Cryptography, vol. 28, no. 3, pp. 783–795 (2025).
