关于图的Bondage数--一个综述及一些评论
On Bondage Numbers of Graphs -- a survey with some comments
摘要：
一个非空图$G$的束缚数是最小边集的基数，该边集从$G$中移除后，图的控制数大于$G$的控制数。本讲对束缚数作了一个综述，包括已有的结果、存在的问题和解决办法。我们还总结了其他类型的束缚数。
英文摘要：
The bondage number of a nonempty graph $G$ is the cardinality of a smallest edge set whose removal from $G$ results in a graph with domination number greater than the domination number of $G$. This lecture gives a survey on the bondage number, including the known results, problems and conjectures. We also summarize other types of bondage numbers.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
