Sharifah Kartini Said Husain

On the rainbow vertex connection number of general unicyclic graphs

Ridho Alfarisi, Arika Indah Kristiana, Sharifah Kartini Said Husain

In this paper: 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 pat...