Trees with 2-reinforcement number three

DOI10.1007/s40840-015-0140-2zbMath1333.05228OpenAlexW943997596MaRDI QIDQ263026

Hai-Long Yang, Weijie Song, You Lu

Publication date: 4 April 2016

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40840-015-0140-2

zbMATH Keywords

trees\(S\)-vulnerable2-domination2-reinforcement number

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• On extremal graphs with internally disjoint Steiner trees
• Trees with maximum \(p\)-reinforcement number
• On the complexity of the bondage and reinforcement problems
• A characterization of graphs with equal domination number and vertex cover number
• A note on total reinforcement in graphs
• \(k\)-domination and \(k\)-independence in graphs: A survey
• Reinforcement numbers of digraphs
• On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
• Signed \(k\)-domatic numbers of digraphs
• On the total \(\{ k\} \)-domination and total \(\{ k\} \)-domatic number of graphs
• On the \(p\)-reinforcement and the complexity
• Global signed domination in graphs
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Trees with 2-reinforcement number three