Secure sets and their expansion in cubic graphs
From MaRDI portal
Publication:403188
DOI10.2478/S11533-014-0411-4zbMATH Open1297.05180OpenAlexW2023789676MaRDI QIDQ403188FDOQ403188
Authors: Katarzyna Jesse-Józefczyk, Elżbieta Sidorowicz Error creating thumbnail:
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
Recommendations
- SECURE DOMINATING SETS AND SECURE DOMINATION POLYNOMIALS OF CYCLES
- The possible cardinalities of global secure sets in cographs
- Security in Sierpiński graphs
- Global security in claw-free cubic graphs
- Complexity of secure sets
- Complexity of secure sets
- Secure dominating sets in the lexicographic product of graphs
- Secure domination and secure total domination in graphs
- Integer and fractional security in graphs
- On minimum secure dominating sets of graphs
Cites Work
- House of Graphs: a database of interesting graphs
- The Generation of Fullerenes
- Global defensive alliances in graphs
- Title not available (Why is that?)
- On a graph's security number
- Monotonicity and expansion of global secure sets
- Security in graphs
- Bounds on a graph's security number
- 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
- Self-stabilizing algorithms for minimal global powerful alliance sets in graphs
- Matching cutsets in graphs
Cited In (3)
Uses Software
This page was built for publication: Secure sets and their expansion in cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q403188)
