- Tytuł:
- Graph domination in distance two
- Autorzy:
-
Bacsó, Gábor
Tálos, Attila
Tuza, Zsolt - Powiązania:
- https://bibliotekanauki.pl/articles/744316.pdf
- Data publikacji:
- 2005
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
graph
dominating set
connected domination
distance domination
forbidden induced subgraph - Opis:
- Let G = (V,E) be a graph, and k ≥ 1 an integer. A subgraph D is said to be k-dominating in G if every vertex of G-D is at distance at most k from some vertex of D. For a given class of graphs, Domₖ is the set of those graphs G in which every connected induced subgraph H has some k-dominating induced subgraph D ∈ which is also connected. In our notation, Dom coincides with Dom₁. In this paper we prove that $Dom Dom _u = Dom₂ _u$ holds for $_u$ = {all connected graphs without induced $P_u$} (u ≥ 2). (In particular, ₂ = {K₁} and ₃ = {all complete graphs}.) Some negative examples are also given.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2005, 25, 1-2; 121-128
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł