Wyniki wyszukiwania dla: LEXICOGRAPHIC PRODUCT

• On the super domination number of lexicographic product graphs

  Publikacja

  • M. Dettlaff
  • M. Lemańska
  • J. A. RODRíGUEZ-VELáZQUEZ
  • R. Zuazua

  - DISCRETE APPLIED MATHEMATICS - Rok 2019

  The neighbourhood of a vertexvof a graphGis the setN(v) of all verticesadjacent tovinG. ForD⊆V(G) we defineD=V(G)\D. A setD⊆V(G) is called a super dominating set if for every vertexu∈D, there existsv∈Dsuch thatN(v)∩D={u}. The super domination number ofGis theminimum cardinality among all super dominating sets inG. In this article weobtain closed formulas and tight bounds for the super dominating number oflexicographic product...

  Pełny tekst do pobrania w portalu