On distance-biregular graphs of girth divisible by four

DOI10.1007/BF01202471zbMath0799.05019OpenAlexW1964418275MaRDI QIDQ1323493

Hiroshi Suzuki

Publication date: 10 May 1994

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01202471

zbMATH Keywords

distance-biregular graphscircuit chasing technique

Mathematics Subject Classification ID

Distance in graphs (05C12)

Related Items (4)

On strongly closed subgraphs of highly regular graphs ⋮ Distance-regular graphs with \(\Gamma(x) \simeq 3* K_{a+1}\) ⋮ The distance-regular graphs of valency four ⋮ On (almost) \(2\)-\(Y\)-homogeneous distance-biregular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On generalized Moore geometries. I, II
• Distance-biregular graphs with 2-valent vertices and distance regular line graphs
• A remark on the intersection arrays of distance-regular graphs
• Bipartite distance-regular graphs of valency three
• Intersection diagrams of distance-biregular graphs

This page was built for publication: On distance-biregular graphs of girth divisible by four