Unique irredundance, domination and independent domination in graphs
From MaRDI portal
Publication:2581412
DOI10.1016/j.disc.2005.08.005zbMath1080.05066OpenAlexW2029114925MaRDI QIDQ2581412
Miranca Fischermann, Lutz Volkmann, Igor Edm. Zverovich
Publication date: 10 January 2006
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2005.08.005
claw-free graphdomination numberhereditary class of graphsirredundance numberdomination perfect graphsunique domination
Related Items
On unique minimum dominating sets in some Cartesian product graphs, Graphs with unique minimum specified domination sets, Common domination perfect graphs, A note on an induced subgraph characterization of domination perfect graphs, The total irredundance numbers on graphs
Cites Work
- On domination and independent domination numbers of a graph
- Graphs with unique maximum independent sets
- On graphs with equal domination and independent domination numbers
- A linear algorithm for the domination number of a tree
- A characterization of uniquely vertex colorable graphs using minimal defining sets
- Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices
- On unique independent sets in graphs
- Maximum graphs with a unique minimum dominating set
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Stability, domination and irredundance in a graph
- Properties of Hereditary Hypergraphs and Middle Graphs
- A note on the characterization of domination perfect graphs
- An induced subgraph characterization of domination perfect graphs
- Block graphs with unique minimum dominating sets
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
