一类极大临界h连通图

A KIND OF MAXIMAL CRITICALLY h-CONNECTED GRAPHS

讨论了最小度等于 3h/ 2 - 1的极大临界 h连通图的性质 ,并给出这类图的构造方法 .

Let h be an integer with h ≥2.A graph G is called ciritically h -connected if G is h -connected but,for every vertex v of G , G-v is not h -connected.A critically h -connected graph G is maximal if G+uv is not critically h -connected for any pair of nonadjacent vertices u and v of G.In this paper,a kind of maximal critically h-connected graphs with  δ(G)=3h/2-1 are characterized where δ(G) is the least degree of G .