Wyniki wyszukiwania dla: K%C5%81ADKA%20DLA%20PIESZYCH

• Anoop Kallingal M.Sc

  Osoby

• Total domination in versus paired-domination in regular graphs

  Publikacja

  • J. Cyman
  • M. Dettlaff
  • M. A. Henning
  • M. Lemańska
  • J. Raczek

  - Discussiones Mathematicae Graph Theory - Rok 2018

  A subset S of vertices of a graph G is a dominating set of G if every vertex not in S has a neighbor in S, while S is a total dominating set of G if every vertex has a neighbor in S. If S is a dominating set with the additional property that the subgraph induced by S contains a perfect matching, then S is a paired-dominating set. The domination number, denoted γ(G), is the minimum cardinality of a dominating set of G, while the...

  Pełny tekst do pobrania w portalu