Partial domination in supercubic graphs
From MaRDI portal
Publication:6080128
DOI10.1016/j.disc.2023.113669arXiv2305.19820MaRDI QIDQ6080128
Sandi Klavžar, Csilla Bujtás, Michael A. Henning
Publication date: 30 October 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2305.19820
Cites Work
- Unnamed Item
- Edge-removal and edge-addition in \(\alpha \)-domination
- An upper bound on the domination number of \(n\)-vertex connected cubic graphs
- On the domination number of generalized petersen graphs \(P(n,2)\)
- On \(\alpha \)-domination in graphs
- Signed domination in regular graphs
- \(\alpha\)-domination
- Bounds on domination parameters in graphs: a brief survey
- Partial domination of maximal outerplanar graphs
- A new bound on the domination number of connected cubic graphs
- Domination in graphs of minimum degree at least two and large girth
- On domination in connected cubic graphs
- Domination number of cubic graphs with large girth
- Graph-theoretic parameters concerning domination, independence, and irredundance
- Partial Domination in Graphs
- Paths, Stars and the Number Three
- Domination in Graphs: Core Concepts
- Topics in Domination in Graphs
- Domination in Cubic Graphs of Large Girth
This page was built for publication: Partial domination in supercubic graphs
