首页> 外文期刊>Graphs and combinatorics >Non-Bipartite Distance-Regular Graphs with Diameters 5, 6 and a Smallest Eigenvalue
【24h】

Non-Bipartite Distance-Regular Graphs with Diameters 5, 6 and a Smallest Eigenvalue

机译:Non-Bipartite Distance-Regular Graphs with Diameters 5, 6 and a Smallest Eigenvalue

获取原文
获取原文并翻译 | 示例
           

摘要

Let C be a non-bipartite distance-regular graphs with valancy k, diameter D and a smallest eigenvalue theta(min). In 2019, Qiao, Jing and Koolen classified the non-bipartite distance-regular graphs with theta(min) <= D-1/D k for D = 4; 5. In this paper, we classify the non-bipartite distance-regular graphs with theta(min) <= -D-2/D-1 k for D = 5, 6. We remark that the technique of this paper is an extension of the approach taken by Qiao, Jing and Koolen on the study of non-bipartite distance-regular graphs in 2019.

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号