- Tytuł:
- Neighbourhood total domination in graphs
- Autorzy:
-
Arumugam, S.
Sivagnanam, C. - Powiązania:
- https://bibliotekanauki.pl/articles/254824.pdf
- Data publikacji:
- 2011
- Wydawca:
- Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie. Wydawnictwo AGH
- Tematy:
-
neighbourhood total domination
total domination
connected domination
paired domination
neighbourhood total domatic number - Opis:
- Let G = (V, E) be a graph without isolated vertices. A dominating set S of G is called a neighbourhood total dominating set (ntd-set) if the induced subgraph ⟨ N(S) ⟩ has no isolated vertices. The minimum cardinality of a ntd-set of G is called the neighbourhood total domination number of G and is denoted by ϒnt(G). The maximum order of a partition of V into ntd-sets is called the neighbourhood total domatic number of G and is denoted by dnt(G). In this paper we initiate a study of these parameters.
- Źródło:
-
Opuscula Mathematica; 2011, 31, 4; 519-531
1232-9274
2300-6919 - Pojawia się w:
- Opuscula Mathematica
- Dostawca treści:
- Biblioteka Nauki
Artykuł