首页> 外文期刊>Sibirskie elektronnye matematicheskie izvestiia: Siberian Electronic Mathematical Reports >Distance-regular graphs with intersectuion arrays {42,30,12;1,6,28} and {60,45,8;1,12,50} do not exist
【24h】

Distance-regular graphs with intersectuion arrays {42,30,12;1,6,28} and {60,45,8;1,12,50} do not exist

机译:具有相交数组{42,30,12; 1,6,28}和{60,45,8; 1,12,50}的距离正则图不存在

获取原文
           

摘要

Koolen and Park obtained the list of intersection arrays for Shilla graphs with b = 3. In particular distance-regular graph with intersectuion array {42, 30, 12; 1, 6, 28} is Shilla graphs with b = 3. Gavri- lyuk and Makhnev investigated properties of a graph with intersectuion array {60, 45, 8; 1, 12, 50}. We proved that distance-regular graphs with intersectuion arrays {42, 30, 12; 1, 6, 28} and {60, 45, 8; 1, 12, 50} do not exist.
机译:Koolen和Park获得了b = 3的Shilla图的相交阵列列表。特别是相交阵列为{42,30,12; 1,6,28}是b = 3的Shilla图。Gavrilyuk和Makhnev研究了相交数组为{60,45,8; 1、12、50}。我们证明了具有相交数组{42,30,12; 1,6,28}和{60,45,8; 1,12,50}不存在。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号