Pages that link to "Item:Q629362"
From MaRDI portal
The following pages link to Partitioning a graph into offensive \(k\)-alliances (Q629362):
Displaying 9 items.
- Alliance polynomial of regular graphs (Q528552) (← 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)
- Alliance free sets in Cartesian product graphs (Q2446344) (← links)
- Alliances and Related Domination Parameters (Q3384109) (← links)
