Pages that link to "Item:Q3433453"
From MaRDI portal
The following pages link to Offensive alliances in cubic graphs (Q3433453):
Displaying 16 items.
- A study of monopolies in graphs (Q367095) (← links)
- Global strong defensive alliances of Sierpiński-like graphs (Q372953) (← links)
- Boundary defensive \(k\)-alliances in graphs (Q708358) (← links)
- Global defensive \(k\)-alliances in graphs (Q1003661) (← links)
- On the global offensive alliance number of a graph (Q1003662) (← links)
- Global defensive alliances in star graphs (Q1026159) (← links)
- Defensive \(k\)-alliances in graphs (Q1027474) (← 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)
- Upper bounds on the global offensive alliances in graphs (Q2217469) (← links)
- An inequality on global alliances for trees (Q2341731) (← links)
- Linear time algorithms for weighted offensive and powerful alliances in trees (Q2342667) (← links)
- On defensive alliances and strong global offensive alliances (Q2434727) (← links)
- Some bounds on global alliances in trees (Q2446301) (← links)
- Global offensive alliances in graphs and random graphs (Q2448887) (← links)
