![](/images/graphics-bg.png)
On Bondage Numbers of Graphs : A Survey with Some Comments
Author
Source
International Journal of Combinatorics
Issue
Vol. 2013, Issue 2013 (31 Dec. 2013), pp.1-34, 34 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2013-05-13
Country of Publication
Egypt
No. of Pages
34
Main Subjects
Abstract EN
The domination number of a graph G is the smallest number of vertices which dominate all remaining vertices by edges of G.
The bondage number of a nonempty graph G is the smallest number of edges whose removal from G results in a graph with domination number greater than the domination number of G.
The concept of the bondage number was formally introduced by Fink et al.
in 1990.
Since then, this topic has received considerable research attention and made some progress, variations, and generalizations.
This paper gives a survey on the bondage number, including known results, conjectures, problems, and some comments, also selectively summarizes other types of bondage numbers.
American Psychological Association (APA)
Xu, Jun-Ming. 2013. On Bondage Numbers of Graphs : A Survey with Some Comments. International Journal of Combinatorics،Vol. 2013, no. 2013, pp.1-34.
https://search.emarefa.net/detail/BIM-483698
Modern Language Association (MLA)
Xu, Jun-Ming. On Bondage Numbers of Graphs : A Survey with Some Comments. International Journal of Combinatorics No. 2013 (2013), pp.1-34.
https://search.emarefa.net/detail/BIM-483698
American Medical Association (AMA)
Xu, Jun-Ming. On Bondage Numbers of Graphs : A Survey with Some Comments. International Journal of Combinatorics. 2013. Vol. 2013, no. 2013, pp.1-34.
https://search.emarefa.net/detail/BIM-483698
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-483698