Block graphs with unique minimum dominating sets
From MaRDI portal
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.
Recommendations
Cited in
(13)- Unique (optimal) solutions: complexity results for identifying and locating-dominating codes
- Unique minimum semipaired dominating sets in trees
- On accurate domination in graphs
- Unique irredundance, domination and independent domination in graphs
- The number of blocks of a graph with given minimum degree
- On unique minimum dominating sets in some repeated Cartesian products
- scientific article; zbMATH DE number 841590 (Why is no real title available?)
- More on the unimodality of domination polynomial of a graph
- Graphs with equal domination and certified domination numbers
- Graphs with unique minimum specified domination sets
- Some rainbow problems in graphs have complexity equivalent to satisfiability problems
- On unique minimum dominating sets in some Cartesian product graphs
- A characterization of block graphs
This page was built for publication: Block graphs with unique minimum dominating sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5948982)