An inequality between intersection numbers of a distance-regular graph

DOI10.1016/0095-8956(87)90012-8MaRDI QIDQ1075341zbMATH OpenOpenAlexFDO

Authors Kazumasa Nomura

Publication date 1987

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(87)90012-8

zbMATH Keywords

distance regular graphintersection arrayintersection number

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Review text

It is shown that the number of columns of type (1,1,k-2) in the intersection array of a distance-regular graph with valency k and girth \(>3\) is at most four.

Cites work

• A remark on the intersection arrays of distance-regular graphs
• Distance degree regular graphs
• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• scientific article; zbMATH DE number 3445271 (Why is no real title available?)

Cited in

(8)

• A remark on the intersection arrays of distance-regular graphs
• Some elementary inequalities for distance-regular graphs
• The distance-regular graphs with intersection number \(a_1\neq 0\) and with an eigenvalue \(-1-(b_1/2)\)
• An application of intersection diagrams of high rank
• Intersection numbers of bipartite distance-regular graphs
• A bound for the number of columns \(\ell_{(c,a,b)}\) in the intersection array of a distance-regular graph
• Intersection diagrams of distance-biregular graphs
• A unified view of inequalities for distance-regular graphs. I

This page was built for publication: An inequality between intersection numbers of a distance-regular graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1075341)