EXTREMAL GRAPHS DOMINATION INSENSITIVE TO THE REMOVAL OF K-EDGES

Authors
HAYNES TW BRIGHAM RC DUTTON RD
Citation
Tw. Haynes et al., EXTREMAL GRAPHS DOMINATION INSENSITIVE TO THE REMOVAL OF K-EDGES, Discrete applied mathematics, 44(1-3), 1993, pp. 295-304
Citations number
22
Categorie Soggetti
Mathematics,Mathematics
Journal title
Discrete applied mathematics → ACNP
Volume
44
Issue
1-3
Year of publication
1993
Pages
295 - 304
Database
ISI
SICI code
Abstract
A connected graph G with order p is defined to be gamma(k)-insensitive if the domination number gamma(G) is unchanged when an arbitrary set of k edges is removed. The problem of finding the least number of edge s in any such graph has been solved for k=1. We determine bounds on th is minimum number which are valid for any p and for k greater-than-or- equal-to 2.