首页 | 本学科首页   官方微博 | 高级检索  
     检索      

PANCONNECTIVITY AND 2-CONNECTED CLAW-FREE GRAPHS
作者姓名:GAO  Jingzhen
作者单位:GAO Jingzhen(Department of Mathematics,Shaddock Normal University,Jinan 250014,China)ZHU Yongjin(Institute of Systems Science,Academia Sinica,Beijing 100080,China)
摘    要:PANCONNECTIVITYAND2-CONNECTEDCLAW-FREEGRAPHS¥GAOJingzhen(DepartmentofMathematics,ShaddockNormalUniversity,Jinan250014,China)Z...


PANCONNECTIVITY AND 2-CONNECTED CLAW-FREE GRAPHS
GAO Jingzhen.PANCONNECTIVITY AND 2-CONNECTED CLAW-FREE GRAPHS[J].Journal of Systems Science and Complexity,1996(1).
Authors:GAO Jingzhen
Abstract: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 are7, n]-panconnected whenever both G-u and G-v are 2-connected.
Keywords:Claw-free graphs  length of path  panconnectivity  
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号