Bipartite distance-regular graphs of valency three

DOI10.1016/0024-3795(82)90035-0zbMath0501.05052OpenAlexW1983239101MaRDI QIDQ1172074

Tatsuro Ito

Publication date: 1982

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0024-3795(82)90035-0

zbMATH Keywords

distance-regular graphsdistance-transitive

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items (10)

On strongly closed subgraphs of highly regular graphs ⋮ Distance-regular graphs with \(\Gamma(x) \simeq 3* K_{a+1}\) ⋮ A characterization of the odd graphs and the doubled odd graphs with a few of their intersection numbers ⋮ On distance-regular graphs with fixed valency. III ⋮ On distance-regular graphs with fixed valency. II ⋮ The regular near polygons of order \((s,2)\) ⋮ On distance-regular graphs with fixed valency ⋮ On symmetric association schemes with \(k_1=3\) ⋮ Distance-regular graphs of valency 6 and \(a_1=1\) ⋮ On distance-biregular graphs of girth divisible by four

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The nonexistence of certain generalized polygons
• Intersection matrices for finite permutation groups
• On a graph of O'Keefe and wong
• Minimal Regular Graphs of Girths Eight and Twelve
• On Minimal graphs of maximum even girth
• On Trivalent Graphs
• A new 5‐arc‐transitive cubic graph

This page was built for publication: Bipartite distance-regular graphs of valency three