Name
Abstract | ||
|---|---|---|
A path in an edge-colored graph is called a rainbow path if the edges on it have distinct colors. For k=1, the rainbow-k-connectivity of a graph G, denoted by rc"k(G), is the minimum number of colors required to color the edges of G in such a way that every two distinct vertices are connected by at least k internally vertex-disjoint rainbow paths. In this paper, we study rainbow-k-connectivity in the setting of random graphs. We show that for every fixed integer d=2 and every k= |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.ipl.2012.01.014 | Inf. Process. Lett. |
Keywords | Field | DocType |
random graph,distinct vertex,vertex-disjoint rainbow path,distinct color,rainbow path,graph g,minimum number,fixed integer,edge-colored graph,edge coloring,discrete mathematics,probabilistic method | Discrete mathematics,Random regular graph,Combinatorics,Graph toughness,Disjoint sets,Cycle graph,Graph bandwidth,Degree (graph theory),Mathematics,Complement graph,Path graph | Journal |
Volume | Issue | ISSN |
112 | 10 | 0020-0190 |
Citations | PageRank | References |
9 | 0.98 | 6 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jing He | 1 | 22 | 2.67 |
| Hongyu Liang | 2 | 84 | 16.39 |