Distance-regular graphs with <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:msub><mml:mi>a</mml:mi><mml:mn>1</mml:mn></mml:msub></mml:math> or <mml:math altimg="si2.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:msub><mml:mi>c</mml:mi><mml:mn>2</mml:mn></mml:msub></mml:math> at least half the valency-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Distance-regular graphs with a1 or c2 at least half the valency

Published:2012-04 Issue:3 Volume:119 Page:546-555
ISSN:0097-3165
Container-title:Journal of Combinatorial Theory, Series A
language:en
Short-container-title:Journal of Combinatorial Theory, Series A

Author:

Koolen Jack H.,Park Jongyook

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference14 articles.

1. Delsarte set graphs with small c2;Bang;Graphs Combin.,2010

2. Improving diameter bounds for distance-regular graphs;Bang;European J. Combin.,2006

3. Cubic distance-regular graphs;Biggs;J. Lond. Math. Soc.,1986

4. Determination of the distance-regular graphs without 3-claws;Blokhuis;Discrete Math.,1997

Cited by 22 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. On the (Non-)Existence of Tight Distance-Regular Graphs: a Local Approach;The Electronic Journal of Combinatorics;2024-05-03

2. Thin Q-Polynomial Distance-Regular Graphs Have Bounded $$c_2$$;Graphs and Combinatorics;2022-10-15

3. On Bounding the Diameter of a Distance-Regular Graph;Combinatorica;2021-11-25

4. A characterization of Johnson and Hamming graphs and proof of Babai's conjecture;Journal of Combinatorial Theory, Series B;2021-11

5. Two characterizations of the grid graphs;Discrete Mathematics;2021-11

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP