Global offensive alliances in graphs and random graphs

DOI10.1016/j.dam.2013.08.018zbMath1288.05191OpenAlexW1978520840MaRDI QIDQ2448887

Ararat Harutyunyan

Publication date: 5 May 2014

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

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

zbMATH Keywords

upper boundsrandom graphdegree sequenceglobal offensive alliances

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Alliances in graphs: parameters, properties and applications -- a survey ⋮ Upper bounds on the global offensive alliances in graphs ⋮ A note on the global offensive alliances in graphs ⋮ Alliances and Related Domination Parameters

Cites Work

• On the global offensive alliance number of a graph
• Global defensive alliances in 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Global offensive alliances in graphs and random graphs