Akademska digitalna zbirka SLovenije - logo
ALL libraries (COBIB.SI union bibliographic/catalogue database)
  • On the rainbow connection of Cartesian products and their subgraphs [Elektronski vir]
    Klavžar, Sandi ; Mekiš, Gašper
    Rainbow connection number of Cartesian products and their subgraphs are considered. Previously known bounds are compared and non-existence of such bounds for subgraphs of products are discussed. It ... is shown that the rainbow connection number of an isometric subgraph of a hypercube is bounded above with the rainbow connection number of the hypercube. Isometric subgraphs of hypercubes with the rainbow connection number smaller as much as possible than the rainbow connection of the hypercube are constructed. The concept of c-strong rainbow coloring is introduced. In particular it is proved that the so-called ▫$\Theta$▫-coloring of an isometric subgraph of a hypercube is its unique optimal c-strong rainbow coloring.
    Source: Preprint series [Elektronski vir]. - ISSN 2232-2094 (Vol. 49, št. 1151, 2011, str. 1-11)
    Type of material - e-article
    Publish date - 2011
    Language - english
    COBISS.SI-ID - 15910233

    Link(s):

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

Shelf entry