PANCONNECTIVITY AND 2-CONNECTED CLAW-FREE GRAPHS  

作　　者：GAO Jingzhen(Department of Mathematics, Shaddock Normal University, Jinan 250014,China)ZHU Yongjin(Institute of Systems Science, Academia Sinica, Beijing 100080,China) 

出　　处：《Systems Science and Mathematical Sciences》1996年第1期5-12,共8页

摘　　要：ＰＡＮＣＯＮＮＥＣＴＩＶＩＴＹＡＮＤ２－ＣＯＮＮＥＣＴＥＤＣＬＡＷ－ＦＲＥＥＧＲＡＰＨＳ￥ＧＡＯＪｉｎｇｚｈｅｎ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ，ＳｈａｄｄｏｃｋＮｏｒｍａｌＵｎｉｖｅｒｓｉｔｙ，Ｊｉｎａｎ２５００１４，Ｃｈｉｎａ）Ｚ...We show that the two distinct venices u and v of a 2-connected claw-free graph G of order n with minimun degree(n- 2)/3 are[7, n]-panconnected whenever both G-u and G-v are 2-connected.

关 键 词：CLAW-FREE GRAPHS LENGTH of PATH panconnectivity. 

分 类 号：O157.5[理学—数学]