关于最优强正则图的一个注记（英文）  

A note on optimistic strongly regular graphs

作　　者：乔智[1] 潘永亮[1] 

机构地区：[1]中国科学技术大学数学科学学院,安徽合肥230026

出　　处：《中国科学技术大学学报》2017年第3期197-203,共7页JUSTC

基　　金：Supported by the Fundamental Research Funds for the Central Universities,the National Natural Science Foundation of China(61272008,11271348,10871189)

摘　　要：人们已经知道,最小特征值为-α的强正则图,除了有限多个补图连通的强正则图外,分成两个无限类,其中α是一个不小于2的整数.在Graham和Lovász提出最优图类的存在性问题后,Azarija对这个问题给出了肯定的回答.这里刻画了最小特征值为-3的强正则图,而且确定了其中的最优图类.It is known that for a fixed integer a ≥ 2, all but finitely many coconnected ones, the strongly regular graphs with smallest eigenvalue - a fall into two infinite families. Graham and Lovdsz raised the question of whether optimistic graphs exist and it was answered positively by Azarija. Here strongly regular graphs were classified with smallest eigenvalue - 3, and the optimistic ones among them were determined.

关 键 词：补图连通图 强正则图 特征值 最优图 

分 类 号：O157.5[理学—数学]