Geodesic
The cobondage number of a graph
Discussiones Mathematicae. Graph Theory, Tome 16 (1996) no. 2, pp. 111-117

Voir la notice de l'article provenant de la source Library of Science

A set D of vertices in a graph G = (V,E) is a dominating set of G if every vertex in V-D is adjacent to some vertex in D. The domination number γ(G) of G is the minimum cardinality of a dominating set. We define the cobondage number b_c(G) of G to be the minimum cardinality among the sets of edges X ⊆ P₂(V) - E, where P₂(V) = X ⊆ V:|X| = 2 such that γ(G+X) γ(G). In this paper, the exact values of b_c(G) for some standard graphs are found and some bounds are obtained. Also, a Nordhaus-Gaddum type result is established.
Keywords: graph, domination number, cobondage number 
@article{DMGT_1996_16_2_a1,
     author = {Kulli, V. and Janakiram, B.},
     title = {The cobondage number of a graph},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {111--117},
     publisher = {mathdoc},
     volume = {16},
     number = {2},
     year = {1996},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_1996_16_2_a1/}
}
TY  - JOUR
AU  - Kulli, V.
AU  - Janakiram, B.
TI  - The cobondage number of a graph
JO  - Discussiones Mathematicae. Graph Theory
PY  - 1996
SP  - 111
EP  - 117
VL  - 16
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_1996_16_2_a1/
LA  - en
ID  - DMGT_1996_16_2_a1
ER  - 
%0 Journal Article
%A Kulli, V.
%A Janakiram, B.
%T The cobondage number of a graph
%J Discussiones Mathematicae. Graph Theory
%D 1996
%P 111-117
%V 16
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_1996_16_2_a1/
%G en
%F DMGT_1996_16_2_a1
Kulli, V.; Janakiram, B. The cobondage number of a graph. Discussiones Mathematicae. Graph Theory, Tome 16 (1996) no. 2, pp. 111-117. http://geodesic.mathdoc.fr/item/DMGT_1996_16_2_a1/