The 2-extendability of strongly regular graphs

Abstract It is proved that every connected strongly regular graph ( v ( G ), k , α , β ) with even order is 2-extendable when k ⩾ 3, except the Petersen graph, the (6, 4, 2, 4) graph and K 4 .

[1]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[2]  Qinglin Yu,et al.  On the classification of 2-extendable Cayley graphs on dihedral groups , 1992, Australas. J Comb..

[3]  Dingjun Lou,et al.  N-extendability of symmetric graphs , 1993, J. Graph Theory.

[4]  Qinglin Yu,et al.  On 2-extendable abelian Cayley graphs , 1995, Discret. Math..

[5]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[6]  Michael D. Plummer,et al.  On n-extendable graphs , 1980, Discret. Math..