کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
6423905 1632593 2011 6 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Rainbow k-connection in Dense Graphs (Extended Abstract)
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
Rainbow k-connection in Dense Graphs (Extended Abstract)
چکیده انگلیسی

An edge-colouring of a graph G is rainbow k-connected if, for any two vertices of G, there are k internally vertex-disjoint paths joining them, each of which is rainbow (i.e., all edges of each path have distinct colours). The minimum number of colours for which there exists a rainbow k-connected colouring for G is the rainbow k-connection number of G, and is denoted by rck(G). The function rck(G) was introduced by Chartrand et al. in 2008, and has since attracted considerable interest. In this note, we shall consider the function rck(G) for complete bipartite and multipartite graphs, highly connected graphs, and random graphs.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Discrete Mathematics - Volume 38, 1 December 2011, Pages 361-366
نویسندگان
, , ,