Graphs with constant sum of domination and inverse domination numbers
From MaRDI portal
Publication:446329
DOI10.1155/2012/831489zbMath1258.05092OpenAlexW1971194864WikidataQ58703372 ScholiaQ58703372MaRDI QIDQ446329
Publication date: 6 September 2012
Published in: International Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2012/831489
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Gallai theorems for graphs, hypergraphs, and set systems
- Inverse domination in graphs
- Efficient dominating sets in Cayley graphs.
- Extremal graphs for inequalities involving domination parameters
- Characterization of graphs with equal domination and covering number
- Trees with two disjoint minimum independent dominating sets
This page was built for publication: Graphs with constant sum of domination and inverse domination numbers