Akademska digitalna zbirka SLovenije - logo
ALL libraries (COBIB.SI union bibliographic/catalogue database)
  • Formulas for various domination numbers of products of paths and cycles
    Repolusk, Polona ; Žerovnik, Janez, 1958-
    The existence of a constant time algorithm for solving different domination problems on the subclass of polygraphs, rotagraphs and fasciagraphs, where the monograph is fixed, is shown by means of ... path algebras. As these graphs include products (the Cartesian, strong, direct, lexicographic) of paths and cycles, we implement the rtlgorithm to get formulas in the case of the domination number, the Roman domination number and the independent domination number of products of paths and cycles where the size of one factor is fixed. We also show that the values of the investigated graph invariants on fasciagraphs and rotagraphs with the same monograph can only differ by a constant value.
    Source: Ars combinatoria. - ISSN 0381-7032 (Vol. 137, 2018, str. 177-202)
    Type of material - article, component part ; adult, serious
    Publish date - 2018
    Language - english
    COBISS.SI-ID - 18281305

source: Ars combinatoria. - ISSN 0381-7032 (Vol. 137, 2018, str. 177-202)
loading ...
loading ...
loading ...