Total domination in block graphs (Q1124531)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4112410
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Total domination in block graphs |
scientific article; zbMATH DE number 4112410 |
Statements
Total domination in block graphs (English)
0 references
1989
0 references
A set of vertices D is a total dominating set for a graph G if every vertex of G is adjacent with at least one vertex in D. Although the problem of determining the minimum cardinality of a total dominating set for an arbitrary graph is NP-complete, polynomial time algorithm are known for certain classes of graphs (e.g. trees, interval graphs). The paper contains an \(O(| V| +| E|)\) time algorithm which solves this problem for block graphs. In fact, the algorithm presented here deals with a more general problem which, for particular instances, gives solutions for both domination and total domination problems.
0 references
polynomial time algorithm
0 references
block graphs
0 references
total domination
0 references
0.894538938999176
0 references
0.8809008002281189
0 references
0.8788220882415771
0 references
0.8426124453544617
0 references
