Title
Extremal Graphs Domination Insensitive To The Removal Of K Edges
Abstract
A connected graph G with order p is defined to be γk-insensitive if the domination number γ(G) is unchanged when an arbitrary set of k edges is removed. The problem of finding the least number of edges in any such graph has been solved for k=1. We determine bounds on this minimum number which are valid for any p and for k ≥ 2. © 1993.
Publication Date
7-19-1993
Publication Title
Discrete Applied Mathematics
Volume
44
Issue
1-3
Number of Pages
295-304
Document Type
Article
Identifier
scopus
Personal Identifier
scopus
DOI Link
https://doi.org/10.1016/0166-218X(93)90238-J
Copyright Status
Unknown
Socpus ID
43949162288 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/43949162288
STARS Citation
Haynes, Teresa W.; Brigham, Robert C.; and Dutton, Ronald D., "Extremal Graphs Domination Insensitive To The Removal Of K Edges" (1993). Scopus Export 1990s. 539.
https://stars.library.ucf.edu/scopus1990/539