UPM Institutional Repository

On the rainbow vertex connection number of general unicyclic graphs


Citation

Alfarisi, Ridho and Kristiana, Arika Indah and Said Husain, Sharifah Kartini (2026) On the rainbow vertex connection number of general unicyclic graphs. Journal of Discrete Mathematical Sciences and Cryptography, 29 (4). pp. 1823-1832. ISSN 0972-0529

Abstract

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.


Download File

[img] Text
127017.pdf - Published Version
Restricted to Repository staff only
Download (460kB)

Additional Metadata

Item Type: Article
Subject: Analysis
Subject: Algebra and Number Theory
Subject: Applied Mathematics
Divisions: Institute for Mathematical Research
DOI Number: https://doi.org/10.47974/JDMSC-2599
Publisher: Taru Publications
Keywords: Rainbow vertex connected; Rainbow vertex connection number; Unicyclic graph
Sustainable Development Goals (SDGs): SDG 9: Industry, Innovation and Infrastructure, SDG 17: Partnerships for the Goals, SDG 4: Quality Education
Depositing User: Ms. Siti Radziah Mohamed@mahmod
Date Deposited: 14 Jul 2026 08:26
Last Modified: 14 Jul 2026 08:26
Altmetrics: http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.47974/JDMSC-2599
URI: http://psasir.upm.edu.my/id/eprint/127017
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item