Abstract
A path in an edge (vertex)-colored graph , where adjacent edges (vertices) may have the same color, is called a rainbow path if no pair of edges (internal vertices) of the path are colored the same. The rainbow (vertex) connection number () of is the minimum integer for which there exists an -edge (vertex)-coloring of such that every two distinct vertices of are connected by a rainbow path. Denote by () the set of all graphs of order with rainbow (vertex) connection number , and define (), where denotes the number of edges in . In this paper, we investigate the bounds of and get the exact asymptotic value. i.e., . Meanwhile, we obtain for , and the equality holds if and only if is such a graph such that deleting all leaves of results in a tree of order .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.