Secure sets and their expansion in cubic graphs
From MaRDI portal
Publication:403188
DOI10.2478/s11533-014-0411-4zbMath1297.05180OpenAlexW2023789676MaRDI QIDQ403188
Elżbieta Sidorowicz, Katarzyna Jesse-Józefczyk
Publication date: 29 August 2014
Published in: Central European Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2478/s11533-014-0411-4
Uses Software
Cites Work
- Unnamed Item
- Self-stabilizing algorithms for minimal global powerful alliance sets in graphs
- Bounds on global secure sets in cactus trees
- Global secure sets of grid-like graphs
- The possible cardinalities of global secure sets in cographs
- On the global offensive alliance number of a graph
- Powerful alliances in graphs
- On a graph's security number
- Global defensive alliances in graphs
- House of Graphs: a database of interesting graphs
- Monotonicity and expansion of global secure sets
- Security in graphs
- Bounds on a graph's security number
- Matching cutsets in graphs
- The Generation of Fullerenes
This page was built for publication: Secure sets and their expansion in cubic graphs
