作 者: ;
机构地区: 华南师范大学南海校区学院数学系
出 处: 《湖北民族学院学报(自然科学版)》 2005年第1期34-37,共4页
摘 要: 图G是简单k-连通图,图G的k-宽直径记作dk(G),图C(n,t)表示在圈Cn上加t边后得到的图,h(n,t)=min{d2(C(n,t))},得到了h(n,3)的下界,以及当t≥n2-n4时,h(n,t)=2. Let G be a simple k-connected graph.The k-wide diameter of graph G,d_k(G), is the minimal integer l such that for any two distinct vertices x,y∈V(G),there are k (internally) disjoint paths with length at most l between x and y.Define h(n,t)=min{d_2(C(n,t)}, let C(n,t) be the resulting graph by adding t edges to circle C_n. In this paper, the lower bound of h(n,3) is obtained, h(n,t)=2 if t≥n^2-n4.