The cobondage number of a graph

  title={The cobondage number of a graph},
  author={B. Janakiram and V. R. Kulli},
  journal={Discussiones Mathematicae Graph Theory},
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 bc(G) of G to be the minimum cardinality among the sets of edges X ⊆ P2(V ) −E, where P2(V ) = {X ⊆ V : |X| = 2} such that γ(G + X) < γ(G). In this paper, the exact values of bc(G) for some standard graphs are found and some bounds are obtained. Also, a Nordhaus… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
2 Extracted Citations
3 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.
Showing 1-2 of 2 extracted citations

Referenced Papers

Publications referenced by this paper.
Showing 1-3 of 3 references

Domination of undirected graphs – A survey

  • E. J. Cockayne, S. T. Hedetniemi
  • In: Theory and Applications of Graphs
  • 1978
1 Excerpt

On complementary graphs

  • E. A. Nordhaus, J. W. Gaddum
  • Amer. Math. Monthly 63
  • 1956

Similar Papers

Loading similar papers…