Using Symbolic Computation to Prove Nonexistence of Distance-Regular Graphs

Electronic Journal Of Combinatorics

Janoš Vidali¹ 

关键词: Distance-regular graphs;    Krein parameters;    Triple intersection numbers;    Nonexistence;    Symbolic computation;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

A package for the Sage computer algebra system is developed for checking feasibility of a given intersection array for a distance-regular graph. We use this tool to show that there is no distance-regular graph with intersection array

【 授权许可】

Others