Edge-removal and edge-addition in \(\alpha \)-domination
From MaRDI portal
Publication:293651
DOI10.1007/S00373-015-1614-6zbMath1338.05203OpenAlexW1103022614MaRDI QIDQ293651
Nader Jafari Rad, Lutz Volkmann
Publication date: 9 June 2016
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-015-1614-6
Related Items (3)
Partial domination in supercubic graphs ⋮ On \(\alpha\)-split domination in graphs ⋮ On \(\alpha \)-domination in graphs
Cites Work
- Unnamed Item
- Domination alteration sets in graphs
- Upper bounds for \(\alpha \)-domination parameters
- \(\alpha \)-domination perfect trees
- On an open problem concerning total domination critical graphs
- On total domination vertex critical graphs of high connectivity
- On the diameter of a domination dot-critical graph
- \(\alpha\)-domination
- Some remarks on alpha-domination
This page was built for publication: Edge-removal and edge-addition in \(\alpha \)-domination