Paper Info
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.
Year
DOI
Venue
1993
10.1016/0166-218X(93)90238-J
Discrete Applied Mathematics
Keywords
DocType
Volume
k edge,extremal graphs domination
Journal
44
Issue
ISSN
Citations 
1-3
Discrete Applied Mathematics
0
PageRank 
References 
Authors
0.34
5
3
Name
Order
Citations
PageRank
Teresa W. Haynes177494.22
Robert C. Brigham215726.74
Ronald D. Dutton319027.80