On a graph's security number
type: Item
instance of: scholarly article
title: On a graph's security number
zbMATH Open document ID: 1205.05166
author: Ronald D. Dutton
published in: Discrete Mathematics
publication date: 2009-12-10T00:00:00Z
Mathematics Subject Classification ID: 05C69
zbMATH DE Number: 5644962
zbMATH Keywords: alliances
zbMATH Keywords: secure sets
zbMATH Keywords: attack
zbMATH Keywords: defense
MaRDI profile type: Publication
full work available at URL: j.disc.2009.02.005
OpenAlex ID: W2088547121
cites work: Unfriendly partitions of a graph
cites work: Powerful alliances in graphs
cites work: Q4677972
cites work: Security in graphs
cites work: Bounds on a graph's security number
cites work: Offensive alliances in graphs
cites work: Q4470237
cites work: Global defensive alliances in graphs
cites work: Q4662347
cites work: Q3635568
cites work: Q4820818
cites work: Q4405794
cites work: Q4472692
cites work: Q3211331
DOI: 10.1016/J.DISC.2009.02.005
description: scientific article; zbMATH DE number 5644962