Distance-biregular graphs with 2-valent vertices and distance regular line graphs

From MaRDI portal
Publication:1058530

DOI10.1016/0095-8956(85)90065-6zbMath0565.05057OpenAlexW2070569225MaRDI QIDQ1058530

Bojan Mohar

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




Related Items (23)

On strongly closed subgraphs of highly regular graphsAutomorphism groups of primitive distance-bitransitive graphs are almost simpleDistance-regular graphs with \(\Gamma(x) \simeq 3* K_{a+1}\)Krein conditions for coherent configurationsIntersection diagrams of distance-biregular graphsOn bounding the diameter of a distance-regular graphOn the 2-\(Y\)-homogeneous condition of the incidence graphs of 2-designsStrongly regular designs and coherent configurations of type \([{32\atop\;3}\)] ⋮ On the Terwilliger algebra of distance-biregular graphsThe \(M\)-matrix group inverse problem for distance-biregular graphsOn geometric distance-regular graphs with diameter threeThere are only finitely many distance-regular graphs of fixed valency greater than twoDistance-regular graphs with or at least half the valencyA characterization of Johnson and Hamming graphs and proof of Babai's conjectureThe regular near polygons of order \((s,2)\)Almost 2-homogeneous graphs and completely regular quadranglesDistance-regularised graphs are distance-regular or distance-biregularOn the distance spectrum of minimal cages and associated distance biregular graphsDistance-regular graphs of valency 6 and \(a_1=1\)The distance-regular graphs of valency fourOn a conjecture of Bannai and Ito: There are finitely many distance-regular graphs with degree 5, 6 or 7On (almost) \(2\)-\(Y\)-homogeneous distance-biregular graphsOn distance-biregular graphs of girth divisible by four



Cites Work


This page was built for publication: Distance-biregular graphs with 2-valent vertices and distance regular line graphs