Akademska digitalna zbirka SLovenije - logo
(UL)
PDF
  • Domination number of graphs with minimum degree five
    Bujtás, Csilla
    We prove that for every graph ▫$G$▫ on ▫$n$▫ vertices and with minimum degree five, the domination number ▫$\gamma (G)$▫ cannot exceed ▫$n/3$▫. The proof combines an algorithmic approach and the ... discharging method. Using the same technique, we provide a shorter proof for the known upper bound ▫$4n/11$▫ on the domination number of graphs of minimum degree four.
    Source: Discussiones mathematicae. Graph theory. - ISSN 1234-3099 (Vol. 41, no. 3, 2021, str. 763-777)
    Type of material - article, component part ; adult, serious
    Publish date - 2021
    Language - english
    COBISS.SI-ID - 117085443

    Link(s):

    https://www.dmgt.uz.zgora.pl/publish/bbl_view_pdf.php?ID=48406
    DOI

source: Discussiones mathematicae. Graph theory. - ISSN 1234-3099 (Vol. 41, no. 3, 2021, str. 763-777)

loading ...
loading ...
loading ...

Shelf entry