Akademska digitalna zbirka SLovenije - logo
VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
PDF
  • General upper bound on the game domination number
    Bujtás, Csilla
    It is conjectured that the game domination number is at most ▫$3 n / 5$▫ for every ▫$n$▫-vertex graph which does not contain isolated vertices. It was proved in the recent years that the conjecture ... holds for several graph classes, including the class of forests and that of graphs with minimum degree at least two. Here we prove that the slightly bigger upper bound ▫$5 n / 8$▫ is valid for every isolate-free graph.
    Vir: Discrete applied mathematics. - ISSN 0166-218X (Vol. 285, Oct. 2020, str. 530-538)
    Vrsta gradiva - članek, sestavni del ; neleposlovje za odrasle
    Leto - 2020
    Jezik - angleški
    COBISS.SI-ID - 31146243

    Povezava(-e):

    https://doi.org/10.1016/j.dam.2020.06.018
    DOI

Vnos na polico