Security in graphs
From MaRDI portal
Publication:2381534
DOI10.1016/j.dam.2007.03.009zbMath1125.05071OpenAlexW2004444066MaRDI QIDQ2381534
Ronald D. Dutton, Stephen T. Hedetniemi, Robert C. Brigham
Publication date: 18 September 2007
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.03.009
Related Items (24)
The security number of strong grid-like graphs ⋮ Global strong defensive alliances of Sierpiński-like graphs ⋮ Global edge alliances in graphs ⋮ Secure domination of honeycomb networks ⋮ Global security in claw-free cubic graphs ⋮ Secure sets and their expansion in cubic graphs ⋮ Secure domination of some graph operators ⋮ Security in Sierpiński graphs ⋮ Global secure sets of grid-like graphs ⋮ Bounds on global secure sets in cactus trees ⋮ Integer and fractional security in graphs ⋮ The security number of lexicographic products ⋮ Alliances in graphs: parameters, properties and applications -- a survey ⋮ Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs ⋮ On the security number of the Cartesian product of graphs ⋮ Bounds on a graph's security number ⋮ Monotonicity and expansion of global secure sets ⋮ Security number of grid-like graphs ⋮ Complexity of secure sets ⋮ \((F, I)\)-security in graphs ⋮ Eternal and Secure Domination in Graphs ⋮ Complexity of Secure Sets ⋮ The possible cardinalities of global secure sets in cographs ⋮ On a graph's security number
Cites Work
This page was built for publication: Security in graphs
