Trees with maximum \(p\)-reinforcement number

DOI10.1016/j.dam.2014.05.022zbMath1298.05072arXiv1211.5742OpenAlexW2157849389MaRDI QIDQ401133

Jun-Ming Xu, You Lu

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

zbMATH Keywords

\(p\)-domination\(p\)-reinforcement number

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Trees with 2-reinforcement number three

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

This page was built for publication: Trees with maximum \(p\)-reinforcement number