Relating the annihilation number and the 2-domination number of block graphs
From MaRDI portal
Publication:1741511
DOI10.1016/j.dam.2019.01.020zbMath1409.05149OpenAlexW2911763724MaRDI QIDQ1741511
Publication date: 3 May 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2019.01.020
Combinatorial aspects of block designs (05B05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph designs and isomorphic decomposition (05C51)
Related Items (5)
Relating the total domination number and the annihilation number for quasi-trees and some composite graphs ⋮ Some more updates on an annihilation number conjecture: pros and cons ⋮ The annihilation number does not bound the 2-domination number from the above ⋮ On an annihilation number conjecture ⋮ Independent \((k + 1)\)-domination in \(k\)-trees
Cites Work
- Unnamed Item
- Unnamed Item
- Roman \(\{2 \}\)-domination
- Averaging 2-rainbow domination and Roman domination
- Relating the annihilation number and the 2-domination number of a tree
- Memory efficient algorithms for cactus graphs and block graphs
- Graphs with equal independence and annihilation numbers
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Bounds on weak Roman and 2-rainbow domination numbers
- The k-neighbor domination problem
- A note on the k-domination number of a graph
- Upper bounds on the \(k\)-domination number and the \(k\)-Roman domination number
- Independence and the Havel-Hakimi residue
- Relating the annihilation number and the total domination number of a tree
- A note on the annihilation number and 2-domination number of a tree
- Bounds on the \(k\)-domination number of a graph
- On the 2-rainbow domination in graphs
- Independence andk-domination in graphs
- Onk-domination and minimum degree in graphs
This page was built for publication: Relating the annihilation number and the 2-domination number of block graphs
