| 具有多个强正则自补图的最小阶数 |
| |
| 引用本文： | 许进. 具有多个强正则自补图的最小阶数[J]. 陕西师范大学学报(自然科学版), 1989, 0(2) |
| |
| 作者姓名： | 许进 |
| |
| 作者单位： | 陕西师范大学数学系 |
| |
| 摘 要： | 本文应用两个不同构的13阶强正则自补图,解决了Kotzig在1979年提出尚未解决的问题:“至少存在两个非同构的4k 1个顶点的强正则自补图集中,其最小整数k是什么?”,获得了最小整数k=3,并且否定了Kotzig在这个问题上所获得的结果.
|
| 关 键 词： | 强正则自补图 正则自补图 最小阶数 |
The Smallest Older with more Strongly Regular Self-complementary Graphs |
| |
| Xu Jin. The Smallest Older with more Strongly Regular Self-complementary Graphs[J]. Journal of Shaanxi Normal University: Nat Sci Ed, 1989, 0(2) |
| |
| Authors: | Xu Jin |
| |
| Affiliation: | Department of Mathematics |
| |
| Abstract: | In this paper, by using two nonisomorphic strongly regular self-complementary graphs with 13 vertices, the author solves the unsolved problem presented by Kotzig in 1979:"What is the smallest integer k with the property that there exist at least two nonisomorphic strongly regular self-complementary graphs on 4k 1 vertices?", and proves that the smallest integer k is 3, and also negatives the result obtained by Kotzig. |
| |
| Keywords: | Strongly regular self-complementary graph regular self-complementary graph the smallest order |
| 本文献已被 CNKI 等数据库收录！ |
