On the bondage number of planar and directed graphs
Discrete Mathematics（2006）
摘要
The bondage number b(G) of a nonempty graph G is defined to be the cardinality of the smallest set E of edges of G such that the graph G-E has domination number greater than that of G. In this paper we present a simple, intuitive proof that b(G)=
更多查看译文
关键词
domination number.,domination number,bondage number,. bondage number,directed graph,planar graph
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要