| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 488618 | Procedia Computer Science | 2015 | 5 Pages |
Abstract
An edge-colored graph G is rainbow connected, if any two vertices are connected by a path whose edges have distinct colors. Such a path is called a rainbow path. The smallest number of colors needed in order to make G rainbow connected is called the rainbow connection number of G, denoted by rc(G). In this paper, we determine the rainbow connection number of a flower (Cm, Kn) and a flower (C3, Fn) graph.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
