Bipartite graphs with five eigenvalues and pseudo designs
From MaRDI portal
Publication:1759326
DOI10.1007/s10801-011-0331-3zbMath1254.05101arXiv0905.2740MaRDI QIDQ1759326
Publication date: 20 November 2012
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0905.2740
BIBD; cospectral graphs; incidence graph; subdivision of star; spectrum of graph; DS graph; pseudo design
05B05: Combinatorial aspects of block designs
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
Cites Work
- Combinatorial designs with two singular values. I: Uniform multiplicative designs
- Small integral trees
- Developments on spectral characterizations of graphs
- A survey of pseudo \((v,k,\lambda)\)-designs
- Which graphs are determined by their spectrum?
- Combinatorial designs with two singular values. II: Partial geometric designs
- Research problems from the 19th British Combinatorial Conference
- An extension of a theorem of the Bruijn and Erdลs on combinatorial designs
- Modular Hadamard matrices and related designs. I
- Symmetric designs and related configurations
- Completion and embedding between pseudo (๐,๐,๐)-designs and (๐,๐,๐)-designs
- Square ฮป-Linked Designs
- Unnamed Item
- Unnamed Item