连通度与强正则图的2—可扩性(英文)

Connectivity and 2-extendability of Strongly Regular Graphs

中文摘要:

      本文证明了所有具有偶顶点数的强正则图是1—可扩的,如果强正则图G具有偶顶点数和参数(v,k,α,β),并且G的圈边连通度至少为3k—3测G是2—可扩的.

英文摘要:

      It is proved that every strongly regular graph with even order is 1-extendable and that if the cyclic edge connectivity of a strongly regular graph G of even order and with parameters (v, k, α,β) is at least 3k-3, G is 2-extendable.