Search
Abstract
A total dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D. A vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The total (double, respectively) domination number of a graph G is the minimum cardinality of a total (double, respectively) dominating set of G. We characterize all trees with double domination number equal to total domination number plus one.
Cite as
Full text
download paper
downloaded 12 times
- Publication version
- Accepted or Published Version
- License
-
open in new tab
Keywords
Details
- Category:
- Articles
- Type:
- artykuł w czasopiśmie wyróżnionym w JCR
- Published in:
-
ARS COMBINATORIA
no. 102,
pages 3 - 10,
ISSN: 0381-7032 - Language:
- English
- Publication year:
- 2011
- Bibliographic description:
- Krzywkowski M.: On trees with double domination number equal to total domination number plus one// ARS COMBINATORIA. -Vol. 102, (2011), s.3-10
- Verified by:
- Gdańsk University of Technology
seen 140 times