The following pages link to Security in graphs (Q2381534):
Displaying 23 items.
- The security number of strong grid-like graphs (Q329713) (← links)
- Global strong defensive alliances of Sierpiński-like graphs (Q372953) (← links)
- Global security in claw-free cubic graphs (Q401130) (← links)
- Secure sets and their expansion in cubic graphs (Q403188) (← links)
- Bounds on global secure sets in cactus trees (Q424125) (← links)
- Integer and fractional security in graphs (Q442229) (← links)
- Global secure sets of grid-like graphs (Q628346) (← links)
- Complexity of secure sets (Q722534) (← links)
- \((F, I)\)-security in graphs (Q741750) (← links)
- The possible cardinalities of global secure sets in cographs (Q764303) (← links)
- Security number of grid-like graphs (Q967295) (← links)
- On a graph's security number (Q1043972) (← links)
- Alliances in graphs: parameters, properties and applications -- a survey (Q1713564) (← links)
- Monotonicity and expansion of global secure sets (Q1761464) (← links)
- Secure domination of honeycomb networks (Q2185819) (← links)
- On the security number of the Cartesian product of graphs (Q2231753) (← links)
- Global edge alliances in graphs (Q2414475) (← links)
- Bounds on a graph's security number (Q2476256) (← links)
- Security in Sierpiński graphs (Q2685692) (← links)
- Complexity of Secure Sets (Q2827802) (← links)
- Eternal and Secure Domination in Graphs (Q3384616) (← links)
- Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs (Q5240230) (← links)
- Secure domination of some graph operators (Q6089327) (← links)
