A note on the global offensive alliances in graphs

DOI10.1016/j.dam.2018.04.019zbMath1398.05153OpenAlexW2807198656MaRDI QIDQ1801085

Nader Jafari Rad

Publication date: 26 October 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.04.019

zbMATH Keywords

probabilistic methodsglobal offensive alliancesglobal strong offensive alliances

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Upper bounds on the global offensive alliances in graphs ⋮ Alliances and Related Domination Parameters

Cites Work

• Partitioning a graph into offensive \(k\)-alliances
• On the global offensive alliance number of a graph
• Global defensive alliances in graphs
• Global offensive alliances in graphs and random graphs
• On defensive alliances and line graphs
• Offensive alliances in cubic graphs
• Global offensive alliances in graphs
• Offensive alliances in graphs
• Spectral study of alliances in graphs
• A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the global offensive alliances in graphs