| 词条 | Bondage number |
| 释义 |
In mathematics, the bondage number of a nonempty graph is the cardinality of the smallest set E of edges such that the domination number of the graph with the edges E removed is strictly greater than the domination number of the original graph.[1][2] The concept was introduced by Fink et. al.[3] References1. ^{{cite journal | doi = 10.1016/0012-365X(90)90348-L | title=The bondage number of a graph | journal=Discrete Mathematics | date=1990 | volume=86 | issue=1-3 | pages=47–57 | first=John Frederick | last=Fink}} {{combin-stub}}2. ^{{cite journal | doi = 10.1016/0012-365X(94)90111-2 | title=Bounds on the bondage number of a graph | journal=Discrete Mathematics | date=1994 | volume=128 | issue=1-3 | pages=173–177 | first=Bert L. | last=Hartnell}} 3. ^{{Cite journal | doi = 10.1155/2013/595210| title = On Bondage Numbers of Graphs: A Survey with Some Comments| journal = International Journal of Combinatorics| volume = 2013| issue = 1| pages = 1| year = 2013| last1 = Xu | first1 = J. M. }} 1 : Graph invariants |
| 随便看 |
开放百科全书收录14589846条英语、德语、日语等多语种百科知识，基本涵盖了大多数领域的百科知识，是一部内容自由、开放的电子版国际百科全书。