Bounds on a graph's security number

DOI10.1016/j.dam.2007.08.037zbMath1135.05048OpenAlexW2070031208MaRDI QIDQ2476256

Yanyan Li

Publication date: 18 March 2008

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.08.037

zbMATH Keywords

extremal graphsdefensive alliancessecure sets

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Related Items (16)

The security number of strong grid-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 ⋮ The security number of lexicographic products ⋮ Alliances in graphs: parameters, properties and applications -- a survey ⋮ On the security number of the Cartesian product of graphs ⋮ Monotonicity and expansion of global secure sets ⋮ Security number of grid-like graphs ⋮ \((F, I)\)-security in graphs ⋮ The possible cardinalities of global secure sets in cographs ⋮ On a graph's security number

Cites Work

• Unfriendly partitions of a graph
• Powerful alliances in graphs
• Global defensive alliances in graphs
• Security in graphs
• Offensive alliances in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounds on a graph's security number