On the rainbow vertex connection number of general unicyclic graphs
Journal of Discrete Mathematical Sciences & Cryptography · 2026 · 29 (4) · 1823-1832
DOI: 10.47974/jdmsc-2599 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Discrete Mathematical Sciences & Cryptography, 2026. Verfasst von Ridho Alfarisi und 2 weiteren Autor:innen.
Abstract (Originalsprache)
In a graph G, the distance between any two vertices is defined as the length of the shortest path connecting them. A path in G is termed rainbow vertex-connected if all internal vertices along the path have distinct colors. For every pair of vertices u and v in G, if there exists such a colored u-v path, the graph is considered rainbow vertex-connected. The minimum number of colors required to ensure that a connected graph G satisfies this condition is called the rainbow vertex-connection number, denoted by rvc(G). This study focuses on analyzing the rainbow vertex-connection number specifically for unicyclic graphs.
Zitieren
APA
Alfarisi, R., Kristiana, A. I., & Husain, S. K. S. (2026). On the rainbow vertex connection number of general unicyclic graphs. Journal of Discrete Mathematical Sciences & Cryptography, 29(4), 1823-1832. https://doi.org/10.47974/jdmsc-2599
Vancouver
Alfarisi R, Kristiana AI, Husain SKS. On the rainbow vertex connection number of general unicyclic graphs. Journal of Discrete Mathematical Sciences & Cryptography. 2026;29(4):1823-1832. doi:10.47974/jdmsc-2599
BibTeX
@article{Alfarisi2026,
author = {Alfarisi, Ridho and Kristiana, Arika Indah and Husain, Sharifah Kartini Said},
title = {On the rainbow vertex connection number of general unicyclic graphs},
journal = {Journal of Discrete Mathematical Sciences & Cryptography},
year = {2026},
volume = {29},
number = {4},
pages = {1823--1832},
doi = {10.47974/jdmsc-2599}
}
EUVIMED