A spectral proof of the uniqueness of a strongly regular graph with parameters (81,20,1,6)

European Journal of Combinatorics（2009）

引用 9|浏览0

暂无评分

摘要

We give a new proof that there exists a unique strongly regular graph with parameters (81,20,1,6). Unlike the finite geometry approach used by Brouwer and Haemers, we use linear algebra and spectral graph theory concepts, namely the technique of star complements, in our proof.

查看译文

关键词

spectral graph theory concept,spectral proof,finite geometry approach,new proof,regular graph,linear algebra,strongly regular graph,spectral graph theory

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要