Intersection diagrams of distance-biregular graphs

DOI10.1016/0095-8956(90)90076-CzbMath0719.05071OpenAlexW2042098558MaRDI QIDQ2639879

Nomura, Kazumasa

Publication date: 1990

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(90)90076-c

zbMATH Keywords

generalized polygondistance-biregulr graphintersection diagram

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items

On strongly closed subgraphs of highly regular graphs ⋮ On the Terwilliger algebra of distance-biregular graphs ⋮ The subconstituent algebra of an association scheme. I ⋮ Applications of the retracing method for distance-regular graphs ⋮ On (almost) \(2\)-\(Y\)-homogeneous distance-biregular graphs ⋮ An application of intersection diagrams of high rank ⋮ On distance-biregular graphs of girth divisible by four

Cites Work

• Unnamed Item
• Distance-biregular graphs with 2-valent vertices and distance regular line graphs
• Distance degree regular graphs
• An inequality between intersection numbers of a distance-regular graph
• A remark on the intersection arrays of distance-regular graphs
• On local structure of a distance-regular graph of Hamming type
• Distance-regularised graphs are distance-regular or distance-biregular
• Current research on algebraic combinatorics. Supplements to our book, Algebraic combinatorics I
• The nonexistence of certain generalized polygons
• Distance-regular graphs of Hamming type