ALL libraries (COBIB.SI union bibliographic/catalogue database)
  • On the Roman domination in the lexicographic product of graphs
    Kraner Šumenjak, Tadeja ; Repolusk, Polona ; Tepeh, Aleksandra
    A Roman dominating function of a graph ▫$G = (V,E)$▫ is a function ▫$f \colon V \to \{0,1,2\}$▫ such that every vertex with ▫$f(v) = 0$▫ is adjacent to some vertex with ▫$f(v) = 2$▫. The Roman ... domination number of ▫$G$▫ is the minimum of ▫$w(f) = \sum_{v \in V}f(v)$▫ over all such functions. Using a new concept of the so-called dominating couple we establish the Roman domination number of the lexicographic product of graphs. We also characterize Roman graphs among the lexicographic product of graphs.
    Source: Discrete applied mathematics. - ISSN 0166-218X (Letn. 160, iss. 13-14, 2012, str. 2030-2036)
    Type of material - article, component part
    Publish date - 2012
    Language - english
    COBISS.SI-ID - 3345708

source: Discrete applied mathematics. - ISSN 0166-218X (Letn. 160, iss. 13-14, 2012, str. 2030-2036)
loading ...
loading ...
loading ...