| 娄定俊.连通度与强正则图的2—可扩性(英文)[J].数学研究及应用,1993,13(1):79~83 |
| 连通度与强正则图的2—可扩性(英文) |
| Connectivity and 2-extendability of Strongly Regular Graphs |
| 投稿时间：1990-10-23 |
| DOI：10.3770/j.issn:1000-341X.1993.01.017 |
| 中文关键词: |
| 英文关键词: |
| 基金项目: |
|
| 摘要点击次数: 2051 |
| 全文下载次数: 1177 |
| 中文摘要: |
| 本文证明了所有具有偶顶点数的强正则图是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. |
| 查看全文 查看/发表评论 下载PDF阅读器 |
|
|
|
