Rooted secure sets of trees

MaRDI QIDQ624145zbMATH OpenFDO

Authors Yiu Yu Ho, Ronald D. Dutton

Publication date 8 February 2011

Published in AKCE International Journal of Graphs and Combinatorics (Search for Journal in Brave)

zbMATH Keywords

defensive alliancegraph algorithmssecure settree

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Bounds on a graph's security number
• Secure set algorithms and complexity
• Global defensive sets in graphs
• The security number of strong grid-like graphs
• On a graph's security number

Cited in

(8)

• On the security number of the Cartesian product of graphs
• Bounds on a graph's security number
• Secure set algorithms and complexity
• Parameterized complexity of secure sets
• scientific article; zbMATH DE number 2170409 (Why is no real title available?)
• Treewidth in non-ground answer set solving and alliance problems in graphs
• Global secure sets of grid-like graphs
• Complexity of secure sets

This page was built for publication: Rooted secure sets of trees

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