Block graphs with unique minimum dominating sets (Q5948982)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Block graphs with unique minimum dominating sets |
scientific article; zbMATH DE number 1672507
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Block graphs with unique minimum dominating sets |
scientific article; zbMATH DE number 1672507 |
Statements
Block graphs with unique minimum dominating sets (English)
0 references
29 March 2002
0 references
The author presents different characterizations of block graphs with unique minimum dominating sets. This is an interesting and non-trivial extension of a 1994 theorem by \textit{G. Gunther, B. Hartnell, L. R. Markus}, and \textit{D. Rall} [Congr. Numerantium 101, 55-63 (1994; Zbl 0836.05045)] for trees. One of the conditions leads to a linear time algorithm to check whether there exists a unique dominating set in a block graph.
0 references
domination
0 references
block graph
0 references
unique dominating set
0 references
characterizations
0 references
0.8306921720504761
0 references
0.8257021903991699
0 references
0.7998070120811462
0 references
