Upper bounds on the global offensive alliances in graphs
From MaRDI portal
Publication:2217469
Recommendations
Cites work
- scientific article; zbMATH DE number 5127204 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 2544 (Why is no real title available?)
- scientific article; zbMATH DE number 2104820 (Why is no real title available?)
- scientific article; zbMATH DE number 7663613 (Why is no real title available?)
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A note on the global offensive alliances in graphs
- A survey on alliances and related parameters in graphs
- Global defensive alliances in graphs
- Global offensive alliances in graphs
- Global offensive alliances in graphs and random graphs
- Offensive \(r\)-alliances in graphs
- Offensive alliances in cubic graphs
- Offensive alliances in graphs
- On defensive alliances and line graphs
- On global offensive \(k\)-alliances in graphs
- On the global offensive alliance number of a graph
- Partitioning a graph into offensive \(k\)-alliances
- Spectral study of alliances in graphs
- The probabilistic method. With an appendix on the life and work of Paul Erdős.
Cited in
(10)- Bounds on powerful alliance numbers
- Global offensive alliance numbers in graphs with emphasis on trees
- A note on the global offensive alliances in graphs
- Offensive alliances in graphs
- Global edge alliances in graphs
- scientific article; zbMATH DE number 5127204 (Why is no real title available?)
- Connected global offensive \(k\)-alliances in graphs
- Global offensive alliances in graphs and random graphs
- On the global offensive alliance number of a graph
- Global offensive alliances in graphs
This page was built for publication: Upper bounds on the global offensive alliances in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2217469)