Rainbow connection

In the paper "A note on generalized rainbow connection of connected graphs and their number of EDGES", we first focus to improve the upper bound of the (1, l)-rainbow connection number depending on the size of connected graphs. Using this result, we characterize all connected graphs having the large (1, 2)-rainbow connection number. Moreover, we also determine the (1, l)-rainbow connection number in a connected graph G containing a sequence of cut-edges.

5p runordie3 27-06-2022 13 2   Download

Let G be an edge-colored graph. A path in G is a conflict-free path if it contains a color used on exactly one of its edges. The graph G is called conflict-free connected if every two distinct vertices is connected by at least one conflict-free path. The graph G is said to be properly edge colored (properly colored for simplifying), meaning an assignment of colors to edges so that no vertex is incident to two edges of the same color.

7p vimarissamayer 02-06-2022 14 1   Download

Tuyển tập các báo cáo nghiên cứu khoa học về toán học trên tạp chí toán học quốc tế đề tài: On rainbow connection...

13p thulanh6 15-09-2011 43 1   Download