No abstract

No abstract

No abstract

Let G be a nontrivial connected graph on which is defined a coloring c : E(G) → {1, 2, • • • , k}, k ∈ N of the edges of G, where adjacent edges may be colored the same. A path in G is called a rainbow path if no two edges of it are colored the same. G is rainbow connected if G contains a rainbow u − v path for every two vertices u and v in it. The minimum k for which there exists such a k-edge coloring is called the rainbow connection number of G, denoted by rc(G). In this paper we find the rainbow connection number of flower snark graph and their criticalness with respect to rainbow coloring.

No abstract