The rainbow connectivity of a graph

摘要: A path P in an edge-colored graph (not necessarily a proper edge-coloring) is rainbow if no two edges of are colored the same. For e-connected G and integer k with 1 ≤ e, k-connectivity rck(G) minimum j for which there exists j-edge-coloring such that every distinct vertices connected by internally disjoint paths. The complete Kn studied various pairs k, n integers. It shown ≥ 2, f(k) rck(Kn) = 2 f(k). We also investigate r-regular bipartite graphs some k,r integers r. each r rck(Kr,r) 3. © 2009 Wiley Periodicals, Inc. NETWORKS,