首页 / 资料库 / 文献详情

Bondage and Reinforcement Number of γf for Complete Multipartite Graph

Xue-gang Chen、孙良、马德香

2003北京理工大学学报：英文版Mathematics被引 9

摘要

The bondage number of γf, bf(G) , is defined to be the minimum cardinality of a set of edges whose removal from G results in a graph G′ satisfying γf(G′)＞γf(G). The reinforcement number of γf, rf(G), is defined to be the minimum cardinality of a set of edges which when added to G results in a graph G′ satisfying γf(G′)＜γf(G). G.S.Domke and R.C.Laskar initiated the study of them and gave exact values of bf(G) and rf(G) for some classes of graphs. Exact values of bf(G) and rf(G) for complete multipartite graphs are given and some results are extended.

引用本文（GB/T 7714）