首页 | 本学科首页   官方微博 | 高级检索  
     检索      

with r an integer and rgreater-or-equal, slanted1. Both cases serve to illustrate a technique which can help in determining structural properties for distance-regular graphs and association schemes with a sufficient number of vanishing Krein parameters.

Using equality in the Krein conditions to prove nonexistence of certain distance-regular graphs
Authors:Kris Coolsaet  Aleksandar Juri&#x;i&#x;
Institution:aDepartment of Applied Mathematics and Computer Science, Ghent University, 9000 Gent, Belgium;bFaculty of Computer and Information Science and IMFM University of Ljubljana, 1000 Ljubljana, Slovenia
Abstract:We prove the nonexistence of a distance-regular graph with intersection array {74,54,15;1,9,60} and of distance-regular graphs with intersection arrays
{4r3+8r2+6r+1,2r(r+1)(2r+1),2r2+2r+1;1,2r(r+1),(2r+1)(2r2+2r+1)}
Keywords:Krein parameters  Association scheme  Distance-regular graph  Strongly regular graph  Triple intersection numbers
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号