Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4949522 | Discrete Applied Mathematics | 2017 | 9 Pages |
Abstract
A path in an edge-colored graph G is rainbow if no two edges of the path are colored the same. An edge-colored graph G is rainbow connected if every two distinct vertices are connected by a rainbow path. The rainbow connection number
rc(G) of G is the smallest number of colors that are needed in order to make G rainbow connected. In this paper, we study bounds of rainbow connection number of some graph operations, such as the union of two graphs, adding edges, deleting edges, and adding vertices and edges. Moreover, we also study the following extremal problem. Let k and n be two integers such that 1â¤kâ¤â
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Hengzhe Li, Yingbin Ma,