Bounds on a graph's security number

DOI10.1016/J.DAM.2007.08.037MaRDI QIDQ2476256zbMATH OpenOpenAlexFDO

Authors 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

defensive alliancesextremal graphssecure sets

Mathematics Subject Classification ID

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

Recommendations

• On a graph's security number
• The security number of strong grid-like graphs
• Rooted secure sets of trees
• Security in graphs
• On the defensive alliances in graph

Cites work

• Global defensive alliances in graphs
• scientific article; zbMATH DE number 4191687 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 1933255 (Why is no real title available?)
• scientific article; zbMATH DE number 2076807 (Why is no real title available?)
• scientific article; zbMATH DE number 2077650 (Why is no real title available?)
• scientific article; zbMATH DE number 2149830 (Why is no real title available?)
• scientific article; zbMATH DE number 2170476 (Why is no real title available?)
• scientific article; zbMATH DE number 2104820 (Why is no real title available?)
• Offensive alliances in graphs
• Powerful alliances in graphs
• Security in graphs
• Unfriendly partitions of a graph

Cited in

(22)

• On a graph's security number
• Alliances in graphs: parameters, properties and applications -- a survey
• Monotonicity and expansion of global secure sets
• Secure domination of honeycomb networks
• On the security number of the Cartesian product of graphs
• Global edge alliances in graphs
• Security in Sierpiński graphs
• The security number of strong grid-like graphs
• scientific article; zbMATH DE number 5139466 (Why is no real title available?)
• Secure set algorithms and complexity
• Global security in claw-free cubic graphs
• Secure sets and their expansion in cubic graphs
• Integer and fractional security in graphs
• The security number of lexicographic products
• scientific article; zbMATH DE number 7746012 (Why is no real title available?)
• Secure domination of some graph operators
• Rooted secure sets of trees
• Global secure sets of grid-like graphs
• k-secure sets and k-security number of a graph
• (F, I)-security in graphs
• The possible cardinalities of global secure sets in cographs
• Security number of grid-like graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2476256)