Pages that link to "Item:Q1422134"
From MaRDI portal
The following pages link to Global defensive alliances in graphs (Q1422134):
Displaying 47 items.
- Strategic balance in graphs (Q279193) (← links)
- Global defensive sets in graphs (Q279197) (← links)
- Global strong defensive alliances of Sierpiński-like graphs (Q372953) (← links)
- Secure sets and their expansion in cubic graphs (Q403188) (← links)
- Global defensive alliances of trees and Cartesian product of paths and cycles (Q412345) (← links)
- Bounds on global secure sets in cactus trees (Q424125) (← links)
- A survey and classification of Sierpiński-type graphs (Q516890) (← links)
- Alliance polynomial of regular graphs (Q528552) (← links)
- Partitioning a graph into defensive \(k\)-alliances (Q546272) (← links)
- On dissemination thresholds in regular and irregular graph classes (Q627518) (← links)
- Partitioning a graph into offensive \(k\)-alliances (Q629362) (← links)
- Boundary defensive \(k\)-alliances in graphs (Q708358) (← links)
- Complexity of secure sets (Q722534) (← links)
- The possible cardinalities of global secure sets in cographs (Q764303) (← links)
- Global defensive \(k\)-alliances in graphs (Q1003661) (← links)
- On the global offensive alliance number of a graph (Q1003662) (← links)
- Offensive \(r\)-alliances in graphs (Q1003773) (← links)
- Powerful alliances in graphs (Q1025468) (← links)
- Partitioning a graph into alliance free sets (Q1025928) (← links)
- On the complement graph and defensive \(k\)-alliances (Q1026126) (← links)
- Global defensive alliances in star graphs (Q1026159) (← links)
- Defensive \(k\)-alliances in graphs (Q1027474) (← links)
- On a graph's security number (Q1043972) (← links)
- Alliances in graphs: parameters, properties and applications -- a survey (Q1713564) (← links)
- A note on the global offensive alliances in graphs (Q1801085) (← links)
- Partitioning a graph into global powerful \(k\)-alliances (Q1926038) (← links)
- Global defensive alliances in the lexicographic product of paths and cycles (Q2192075) (← links)
- Upper bounds on the global offensive alliances in graphs (Q2217469) (← links)
- Saturated boundary \(k\)-alliances in graphs (Q2341725) (← links)
- An inequality on global alliances for trees (Q2341731) (← links)
- Linear time algorithms for weighted offensive and powerful alliances in trees (Q2342667) (← links)
- Security in graphs (Q2381534) (← links)
- Global edge alliances in graphs (Q2414475) (← links)
- Some bounds on global alliances in trees (Q2446301) (← links)
- Global offensive alliances in graphs and random graphs (Q2448887) (← links)
- Bounds on a graph's security number (Q2476256) (← links)
- On defensive alliances and line graphs (Q2481439) (← links)
- Alliances and Related Domination Parameters (Q3384109) (← links)
- Global offensive alliances in graphs (Q3439495) (← links)
- ON CONNECTED GLOBAL OFFENSIVE k-ALLIANCE NUMBER OF SOME GRAPHS (Q5036129) (← links)
- The complexity of open k-monopolies in graphs for negative k (Q5106671) (← links)
- (Q5152645) (← links)
- On defensive alliance in zero-divisor graphs (Q5157904) (← links)
- Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs (Q5240230) (← links)
- On global defensive k-alliances in zero-divisor graphs of finite commutative rings (Q6104115) (← links)
- k-STRONG DEFENSIVE ALLIANCES IN GRAPHS (Q6149003) (← links)
- On the global powerful alliance number of zero-divisor graphs of finite commutative rings (Q6669427) (← links)
