Domination with respect to nondegenerate properties: bondage number

For a graphical property P and a graph G, a subset S of vertices of G is a P-set if the subgraph induced by S has the property P . The domination number with respect to the property P , denoted by γP(G), is the minimum cardinality of a dominating P-set. The bondage number with respect to the property P of a nonempty graph G, denoted bP(G), is the cardinality of a smallest set of edges whose removal from G results in a graph with domination number with respect to P unequal to γP(G). In this paper we show that some known sharp upper bounds for the ordinary bondage number are sharp upper bounds for bP(G) as well.

[1]  E. Sampathkumar,et al.  Domination and neighbourhood critical, fixed, free and totally free points , 1992 .

[2]  Wayne Goddard,et al.  Hereditary domination and independence parameters , 2004, Discuss. Math. Graph Theory.

[3]  Jinjiang Yuan,et al.  Bondage number of planar graphs , 2000, Discret. Math..

[4]  Michael A. Henning,et al.  Changing and unchanging domination: a classification , 2003, Discret. Math..

[5]  Frank Harary,et al.  Domination alteration sets in graphs , 1983, Discret. Math..

[6]  Douglas F. Rall,et al.  A bound on the size of a graph with given order and bondage number , 1999, Discret. Math..

[7]  Michael S. Jacobson,et al.  The bondage number of a graph , 1991, Discret. Math..

[8]  Lonnie Athens.  ‘Domination’ , 2002 .

[9]  Jochen Harant,et al.  On Domination in Graphs , 2005, Discuss. Math. Graph Theory.

[11]  Dieter Rautenbach,et al.  Remarks on the bondage number of planar graphs , 2003, Discret. Math..

[12]  S. Hedetniemi,et al.  Domination in graphs : advanced topics , 1998 .

[13]  Ulrich Teschner.  The bondage number of a graph G can be much greater than Delta(G) , 1996, Ars Comb..

[14]  Mike Develin,et al.  On the bondage number of planar and directed graphs , 2006, Discret. Math..

[15]  Vladimir Samodivkin.  Changing and unchanging of the domination number of a graph , 2008, Discret. Math..

[16]  Douglas F. Rall,et al.  Bounds on the bondage number of a graph , 1994, Discret. Math..

[17]  Christina M. Mynhardt,et al.  Domination parameters and edge-removal-critical graphs , 2001, Discret. Math..

[18]  Robert B. Allan,et al.  On domination and independent domination numbers of a graph , 1978, Discret. Math..

[19]  Ulrich Teschner,et al.  New results about the bondage number of a graph , 1997, Discret. Math..

[20]  Yue-Li Wang,et al.  On the bondage number of a graph , 1996, Discret. Math..

[21]  Douglas F. Rall,et al.  Acyclic domination , 2000, Discret. Math..

[22]  Danuta Michalak.  Domination, independence and irredundance with respect to additive induced-hereditary properties , 2004, Discret. Math..

[23]  Ulrich Teschner.  A counterexample to a conjecture on the bondage number of a graph , 1993, Discret. Math..

[24]  Odile Favaron,et al.  On i--ER-critical graphs , 2004, Discret. Math..

[25]  Ulrich Teschner,et al.  A new upper bound for the bondage number of graphs with small domination number , 1995, Australas. J Comb..

[26]  Vladimir Samodivkin.  The bondage number of graphs: good and bad vertices , 2008, Discuss. Math. Graph Theory.