A counterexample to a conjecture on the bondage number of a graph
暂无分享,去创建一个
Abstract The bondage number b(G) of a nonempty graph G was first introduced by Fink, Jacobson, Kinch and Roberts in [3]. They generalized a former approach to domination-critical graphs. In their publication they conjectured that b(G)⩽Δ(G)+1 for any nonempty graph G. In this note we present a counterexample for the conjecture.
[1] Ronald D. Dutton,et al. Vertex domination-critical graphs , 1988, Networks.
[2] Michael S. Jacobson,et al. The bondage number of a graph , 1991, Discret. Math..
[3] Frank Harary,et al. Domination alteration sets in graphs , 1983, Discret. Math..
[4] Frank Harary,et al. Graph Theory , 2016 .