摘要A connected graph G is called t-tough if t·w(G—S)≤|S| for any subset S of V(G), where t is a real number and w(G—S) is the number of components of G—S.
2LI Jianping,TIAN Feng,SHEN Ruqun Institute of Systems Science,Academia Sinica,Beijing 100080,China Institute of Biophysics, Academia Sinica, Beijing 100101, China.A FURTHER GENERALIZATION OF JUNG'S THEOREM[J].Systems Science and Mathematical Sciences,1993,6(1):52-60.
7SHANG Li 1,& ZHANG HePing 2 1 School of Information Science and Engineering,Lanzhou University,Lanzhou 730000,China,2 School of Mathematics and Statistics,Lanzhou University,Lanzhou 730000,China.A general sufficient condition for a graph G with λ_m(G)≤ξ_m(G)[J].Science China Mathematics,2010,53(4):1039-1044. 被引量:3