Distance biregular bipartite graphs

DOI10.1006/eujc.1994.1024zbMath0804.05031OpenAlexW2093170838MaRDI QIDQ1329071

Charles Delorme

Publication date: 9 January 1995

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1994.1024

zbMATH Keywords

distance regular graphKrein inequalitiesstable componentbipartite connected graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items (15)

A Spectral Moore Bound for Bipartite Semiregular Graphs ⋮ On strongly closed subgraphs of highly regular graphs ⋮ Krein conditions for coherent configurations ⋮ On the 2-\(Y\)-homogeneous condition of the incidence graphs of 2-designs ⋮ From local adjacency polynomials to locally pseudo-distance-regular graphs ⋮ On the Terwilliger algebra of distance-biregular graphs ⋮ The spectral excess theorem for distance-biregular graphs. ⋮ The \(M\)-matrix group inverse problem for distance-biregular graphs ⋮ Completely regular clique graphs ⋮ Pseudo-distance-regularized graphs are distance-regular or distance-biregular ⋮ The subconstituent algebra of an association scheme. I ⋮ On the Laplacian spectra of token graphs ⋮ Locally s-distance transitive graphs ⋮ On (almost) \(2\)-\(Y\)-homogeneous distance-biregular graphs ⋮ Completely regular clique graphs. II

This page was built for publication: Distance biregular bipartite graphs