Edge stability in secure graph domination - Archive ouverte HAL Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2015

Edge stability in secure graph domination

Abstract

A subset X of the vertex set of a graph G is a secure dominating set of G if X is a dominating set of G and if, for each vertex u not in X, there is a neighbouring vertex v of u in X such that the swap set (X-v)∪u is again a dominating set of G. The secure domination number of G is the cardinality of a smallest secure dominating set of G. A graph G is p-stable if the largest arbitrary subset of edges whose removal from G does not increase the secure domination number of the resulting graph, has cardinality p. In this paper we study the problem of computing p-stable graphs for all admissible values of p and determine the exact values of p for which members of various infinite classes of graphs are p-stable. We also consider the problem of determining analytically the largest value ωn of p for which a graph of order n can be p-stable. We conjecture that ωn=n-2 and motivate this conjecture.
Fichier principal
Vignette du fichier
dmtcs-17-1-8.pdf (434.58 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01196864 , version 1 (10-09-2015)

Identifiers

Cite

Anton Pierre Burger, Alewyn Petrus De Villiers, Jan Harm Van Vuuren. Edge stability in secure graph domination. Discrete Mathematics and Theoretical Computer Science, 2015, Vol. 17 no. 1 (1), pp.103--122. ⟨10.46298/dmtcs.2120⟩. ⟨hal-01196864⟩

Collections

TDS-MACS
82 View
980 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More