Search
Abstract
Let G = (V,E) be a graph without an isolated vertex. A set D ⊆ V (G) is a total dominating set if D is dominating and the in- duced subgraph G[D] does not contain an isolated vertex. The total domination number of G is the minimum cardinality of a total domi- nating set of G. A set D ⊆ V (G) is a total outer–connected dominating set if D is total dominating and the induced subgraph G[V (G)−D] is a connected graph. The total outer–connected domination number of G is the minimum cardinality of a total outer–connected dominating set of G. We characterize all unicyclic graphs with equal total domination and total outer–connected domination numbers.
Cite as
Full text
full text is not available in portal
Keywords
Details
- Category:
- Articles
- Type:
- artykuł w czasopiśmie wyróżnionym w JCR
- Published in:
-
ARS COMBINATORIA
no. 118,
pages 167 - 178,
ISSN: 0381-7032 - Language:
- English
- Publication year:
- 2015
- Bibliographic description:
- Raczek J.: Unicyclic graphs with equal total and total outer-connected domination numbers// ARS COMBINATORIA. -Vol. 118, (2015), s.167-178
- Verified by:
- Gdańsk University of Technology
seen 161 times
Recommended for you
Total Domination Versus Domination in Cubic Graphs
- J. Cyman,
- M. Dettlaff,
- M. A. Henning
- + 2 authors
2018