The Vertex-Rainbow Connection Number of Some Graph Operations

The Vertex-Rainbow Connection Number of Some Graph Operations

A path in an edge-colored (respectively vertex-colored) graph G is rainbow (respectively vertex-rainbow) if no two edges (respectively internal vertices) of the path are colored the same. An edge-colored (respectively vertex-colored) graph G is rainbow connected (respectively vertex-rainbow connecte...

Full description

Bibliographic Details
Main Authors: Li Hengzhe, Ma Yingbin, Li Xueliang
Format: Article
Language:English
Published: University of Zielona Góra 2021-05-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
rainbow connection number
vertex-rainbow connection number
cartesian product
lexicographic product
line graph
05c15
05c40
05c76
Online Access:https://doi.org/10.7151/dmgt.2206

Internet

https://doi.org/10.7151/dmgt.2206

Similar Items