DIKUL - logo
(UL)
  • Rainbow connection and graph products [Elektronski vir]
    Dravec, Tanja ; Mekiš, Gašper ; Peterin, Iztok
    A path in an edge colored graph ▫$G$▫ is called a rainbow path if all its edges have pairwise different colors. Then ▫$G$▫ is rainbow connected if there exists a rainbow path between every pair of ... vertices of ▫$G$▫ and the least number of colors needed to obtain a rainbow connected graph is the rainbow connection number. If we demand that there must exist a shortest rainbow path between every pair of vertices, we speak about strongly rainbow connected graph and the strong rainbow connection number. In this paper we study the (strong) rainbow connection number on direct, strong, and lexicographic product and present several upper bounds for these products that are attained by many graphs. Several exact results are also obtained.
    Vir: Preprint series [Elektronski vir]. - ISSN 2232-2094 (Vol. 49, št. 1149, 2011, str. 1-18)
    Vrsta gradiva - e-članek
    Leto - 2011
    Jezik - angleški
    COBISS.SI-ID - 15899993

    Povezava(-e):

    http://www.imfm.si/preprinti/PDF/01149.pdf

Vnos na polico