The following pages link to Powerful alliances in graphs (Q1025468):
Displaying 17 items.
- Self-stabilizing algorithms for minimal global powerful alliance sets in graphs (Q396595) (← links)
- Secure sets and their expansion in cubic graphs (Q403188) (← links)
- Partitioning a graph into defensive \(k\)-alliances (Q546272) (← links)
- On global offensive \(k\)-alliances in graphs (Q602832) (← links)
- Boundary defensive \(k\)-alliances in graphs (Q708358) (← links)
- Global defensive \(k\)-alliances in graphs (Q1003661) (← links)
- Partitioning a graph into alliance free sets (Q1025928) (← links)
- On a graph's security number (Q1043972) (← links)
- Alliances in graphs: parameters, properties and applications -- a survey (Q1713564) (← links)
- Partitioning a graph into global powerful \(k\)-alliances (Q1926038) (← links)
- Global defensive alliances in the lexicographic product of paths and cycles (Q2192075) (← links)
- Saturated boundary \(k\)-alliances in graphs (Q2341725) (← links)
- Linear time algorithms for weighted offensive and powerful alliances in trees (Q2342667) (← links)
- Security in graphs (Q2381534) (← links)
- Bounds on a graph's security number (Q2476256) (← links)
- Alliances and Related Domination Parameters (Q3384109) (← links)
- k-STRONG DEFENSIVE ALLIANCES IN GRAPHS (Q6149003) (← links)
