A note on the global offensive alliances in graphs
type: Item
instance of: scholarly article
title: A note on the global offensive alliances in graphs
zbMATH Open document ID: 1398.05153
published in: Discrete Applied Mathematics
publication date: 2018-10-26T00:00:00Z
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 6966427
zbMATH Keywords: global offensive alliances
zbMATH Keywords: global strong offensive alliances
zbMATH Keywords: probabilistic methods
author: Nader Jafari Rad
MaRDI profile type: Publication
full work available at URL: j.dam.2018.04.019
OpenAlex ID: W2807198656
cites work: The probabilistic method. With an appendix on the life and work of Paul Erdős.
cites work: Q3423990
cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
cites work: Q4711489
cites work: Offensive alliances in graphs
cites work: Q3691778
cites work: Q3691779
cites work: Global offensive alliances in graphs and random graphs
cites work: Global defensive alliances in graphs
cites work: Q4368728
cites work: Q4820818
cites work: Offensive alliances in cubic graphs
cites work: Global offensive alliances in graphs
cites work: On defensive alliances and line graphs
cites work: Spectral study of alliances in graphs
cites work: On the global offensive alliance number of a graph
cites work: Partitioning a graph into offensive \(k\)-alliances
Wikidata QID: Q129731609
DOI: 10.1016/J.DAM.2018.04.019
description: scientific article; zbMATH DE number 6966427