Trees with maximum \(p\)-reinforcement number
From MaRDI portal
Publication:401133
DOI10.1016/j.dam.2014.05.022zbMath1298.05072arXiv1211.5742MaRDI QIDQ401133
Publication date: 26 August 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.5742
05C05: Trees
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Related Items
Cites Work
- On the complexity of the bondage and reinforcement problems
- A note on total reinforcement in graphs
- \(k\)-domination and \(k\)-independence in graphs: A survey
- A note on the k-domination number of a graph
- Reinforcement numbers of digraphs
- On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
- Bounds on the \(k\)-domination number of a graph
- On domination and reinforcement numbers in trees
- Some bounds on the \(p\)-domination number in trees
- Independence andk-domination in graphs
- Onk-domination and minimum degree in graphs
- Theory and Application of Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item