Matching extensions of strongly regular graphs.
Derek Holton, Dingjun Lou · 1992
Let J3 be the number of vertices commonly adjacent to any pair of non-adjacent vertices. It is proved that every strongly regular graph with even order and J3 ~ 1 is 1-extendable. We also show that every strongly regular graph of degree at least 3 and cyclic edge connectivity at least 3k-3 is 2-extendab Ie. Strongly regular graphs of k even order and of degree k at least 3 with J3 ~"3 are 2-extendab Ie, except the Petersen graph and one other graph.