On Bondage Numbers of Graphs -- a survey with some comments
Jun-Ming Xu

TL;DR
This survey reviews the current state of research on bondage numbers in graphs, discussing known results, open problems, conjectures, and related concepts in the field.
Contribution
It compiles and comments on existing results, problems, and conjectures about bondage numbers, providing a comprehensive overview and insights into future research directions.
Findings
Summarizes key known results on bondage numbers.
Highlights open problems and conjectures in the field.
Introduces and discusses other types of bondage numbers.
Abstract
The bondage number of a nonempty graph is the cardinality of a smallest edge set whose removal from results in a graph with domination number greater than the domination number of . This lecture gives a survey on the bondage number, including the known results, problems and conjectures. We also summarize other types of bondage numbers.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Graph Labeling and Dimension Problems · Limits and Structures in Graph Theory
