Distance-biregular graphs with 2-valent vertices and distance regular line graphs
From MaRDI portal
Publication:1058530
DOI10.1016/0095-8956(85)90065-6zbMath0565.05057MaRDI QIDQ1058530
Publication date: 1985
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(85)90065-6
05C99: Graph theory
Related Items
Almost 2-homogeneous graphs and completely regular quadrangles, Automorphism groups of primitive distance-bitransitive graphs are almost simple, Strongly regular designs and coherent configurations of type \([{32\atop\;3}\)], The distance-regular graphs of valency four, On distance-biregular graphs of girth divisible by four, Distance-regular graphs of valency 6 and \(a_1=1\), The regular near polygons of order \((s,2)\), Distance-regularised graphs are distance-regular or distance-biregular, On a conjecture of Bannai and Ito: There are finitely many distance-regular graphs with degree 5, 6 or 7, On strongly closed subgraphs of highly regular graphs, Distance-regular graphs with \(\Gamma(x) \simeq 3* K_{a+1}\), Krein conditions for coherent configurations, Intersection diagrams of distance-biregular graphs
Cites Work
