摘要： The bondage number b(G)of a graph G is defined to be the cardinality of a smallest set E of edges for which λ(G-B)>λ(G).In this paper,we get the bondage number of P₂×P..
中图分类号:
李育强. A Note on the Bondage Number of a Graph[J]. 数学季刊, 1994, 9(4): 1-3.
Li Yuqiang. A Note on the Bondage Number of a Graph[J]. Chinese Quarterly Journal of Mathematics, 1994, 9(4): 1-3.
