搜索结果: 1-4 共查到“数学 rainbow connection number”相关记录4条 . 查询时间(0.078 秒)
A solution to a conjecture on the rainbow connection number
edge-colored graph (strong) rainbow coloring (strong) rainbow con-nection number
2011/1/21
For a graph G, Chartrand et al. defined the rainbow connection number rc(G)and the strong rainbow connection number src(G) in “G. Charand, G.L. John,K.A. Mckeon, P. Zhang, Rainbow connection in graphs...
Nordhaus-Gaddum-type theorem for rainbow connection number of graphs
edge-colored graph rainbow connection number Nordhaus-Gaddumtype
2011/1/21
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of G, denoted rc(G), is the minimum number of c...
A path in an edge-colored graph, where adjacent edges may be colored the same, is a rainbow path if no two edges of it are colored the same. A nontrivial connected graph $G$ is rainbow connected if th...
Rainbow connection number, rc(G), of a connected graph G is the minimum number of colours needed to colour its edges, so that every pair of vertices is connected by at least one path in which no two e...