Bondage number explained

In the mathematical field of graph theory, the bondage number of a nonempty graph is the cardinality of the smallest set of edges such that the domination number of the graph with the edges removed is strictly greater than the domination number of the original graph.[1] [2] The concept was introduced by Fink et al.[3]

Notes and References

  1. 10.1016/0012-365X(90)90348-L . The bondage number of a graph . Discrete Mathematics . 1990 . 86 . 1–3 . 47–57 . John Frederick . Fink. free .
  2. 10.1016/0012-365X(94)90111-2 . Bounds on the bondage number of a graph . Discrete Mathematics . 1994 . 128 . 1–3 . 173–177 . Bert L. . Hartnell.
  3. 10.1155/2013/595210. On Bondage Numbers of Graphs: A Survey with Some Comments. International Journal of Combinatorics. 2013. 1. 1–34. 2013. Xu . J. M. . free. 1204.4010.

This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Bondage number".

Except where otherwise indicated, Everything.Explained.Today is © Copyright 2009-2024, A B Cryer, All Rights Reserved. Cookie policy.