Bounds on global secure sets in cactus trees

DOI10.2478/S11533-012-0035-5zbMath1239.05139OpenAlexW1965731829MaRDI QIDQ424125

Katarzyna Jesse-Józefczyk

Publication date: 31 May 2012

Published in: Central European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2478/s11533-012-0035-5

zbMATH Keywords

graphdominating setalliancesecure setcactus tree

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (4)

The security number of strong grid-like graphs ⋮ Secure sets and their expansion in cubic graphs ⋮ The security number of lexicographic products ⋮ On the security number of the Cartesian product of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Global defensive alliances in graphs
• Security in graphs
• Global alliances and independence in trees

This page was built for publication: Bounds on global secure sets in cactus trees