<mml:math altimg="si1.gif" display="inline" 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:mi>Q</mml:mi></mml:math>-polynomial distance-regular graphs with <mml:math altimg="si2.gif" display="inline" 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:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mn>0</mml:mn></mml:math> and <mml:math altimg="si3.gif" display="inline" 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:mrow><mml:mi>a</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>≠</mml:mo><mml:mn>0</mml:mn></mml:math>-Reference-Cited by-同舟云学术

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

Q-polynomial distance-regular graphs with a1=0 and a2≠0

Published:2009-01 Issue:1 Volume:30 Page:192-207
ISSN:0195-6698
Container-title:European Journal of Combinatorics
language:en
Short-container-title:European Journal of Combinatorics

Author:

Miklavič Štefko

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics

Reference27 articles.

1. E. Bannai, T. Ito, Algebraic Combinatorics I: Association schemes, in: Benjamin-Cummings Lecture Notes, vol. 58, Menlo Park, 1984

2. Distance-Regular Graphs;Brouwer,1989

3. The Terwilliger algebras of bipartite P- and Q-polynomial association schemes;Caughman;Discrete Math.,1999

4. The Terwilliger algebra of an almost-bipartite P- and Q-polynomial scheme;Caughman;Discrete Math.,2005

5. The girth of a thin distance-regular graph;Collins;Graphs Combin.,1997

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

1. Distance-Regular Graphs with Classical Parameters that Support a Uniform Structure: Case $$q \le 1$$;Bulletin of the Malaysian Mathematical Sciences Society;2023-10-18

2. On a certain class of 1-thin distance-regular graphs;Ars Mathematica Contemporanea;2020-10-18

3. An A-invariant subspace for bipartite distance-regular graphs with exactly two irreducible T-modules with endpoint 2, both thin;Journal of Algebraic Combinatorics;2017-11-01

4. Bipartite Q-polynomial distance-regular graphs and uniform posets;Journal of Algebraic Combinatorics;2012-10-09

5. On the shape of a tridiagonal pair;Linear Algebra and its Applications;2010-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP