| Connectivity and 2-extendability of Strongly Regular Graphs |
| Received:October 23, 1990 |
| Key Words:
|
| Fund Project: |
|
| Hits: 2052 |
| Download times: 1178 |
| Abstract: |
| 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. |
| Citation: |
| DOI:10.3770/j.issn:1000-341X.1993.01.017 |
| View Full Text View/Add Comment |
