A NEW RESULT ABOUT PANCONNECTIVITY ON GRAPHS  

作　　者：卫兵 朱永津 朱永津 

机构地区：[1]Huazhong Normal University [2]Institute of Systems Science, Academia Sinica [3]Huazhong Normal University Institute of Systems Science, Academia Sinicaet G be a simple graph such that the sum of tbe degrees of any two independent vertices of Gis at least n-1. We Shall prove that G is [6, n]--panconnected except for four kinds of graphs.

出　　处：《Acta Mathematicae Applicatae Sinica》1991年第2期143-149,共7页应用数学学报（英文版）

摘　　要： Let G be a simple graph such that the sum of tbe degrees of any two independent vertices of Gis at least n-1. We Shall prove that G is [6, n]--panconnected except for four kinds of graphs.Let G be a simple graph such that the sum of tbe degrees of any two independent vertices of Gis at least n-1. We Shall prove that G is [6, n]--panconnected except for four kinds of graphs.

分 类 号：O1[理学—数学]