Combinatorial designs with two singular values. II: Partial geometric designs
From MaRDI portal
Publication:1763839
DOI10.1016/j.laa.2004.09.015zbMath1055.05020OpenAlexW3123487364MaRDI QIDQ1763839
van Dam, Edwin R., Spence, Edward
Publication date: 22 February 2005
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://research.tilburguniversity.edu/en/publications/e23b8b46-4f9e-4d76-b792-d0d73e674d80
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Combinatorial aspects of finite geometries (05B25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Statistical block designs (62K10)
Related Items
On bipartite distance-regular Cayley graphs with small diameter ⋮ Partial geometric designs with prescribed automorphisms ⋮ Regular graphs with girth at least 5 and small second largest eigenvalue ⋮ On regular graphs with four distinct eigenvalues ⋮ Characterizing distance-regularity of graphs by the spectrum ⋮ Three-class association schemes from partial geometric designs ⋮ Combinatorial designs with two singular values. I: Uniform multiplicative designs ⋮ On 2-equitable graphs ⋮ Self‐dual association schemes, fusions of Hamming schemes, and partial geometric designs ⋮ A Family of Partial Geometric Designs from Three-Class Association Schemes ⋮ Partial geometric designs with block sizes three and four ⋮ INVESTIGATION OF CONTINUOUS-TIME QUANTUM WALKS VIA SPECTRAL ANALYSIS AND LAPLACE TRANSFORM ⋮ Partial geometric designs having circulant concurrence matrices ⋮ Regular bipartite graphs with three distinct non-negative eigenvalues ⋮ On optimality of designs with three distinct eigenvalues ⋮ Graphs with four distinct Laplacian eigenvalues ⋮ Unnamed Item ⋮ Constructions of \(1 \frac{1}{2}\)-designs from orthogonal geometry over finite fields ⋮ A framework for constructing partial geometric difference sets ⋮ Bipartite graphs with five eigenvalues and pseudo designs ⋮ Two spectral characterizations of regular, bipartite graphs with five eigenvalues ⋮ Research problems from the 19th British Combinatorial Conference ⋮ Partial geometric difference sets and partial geometric difference families ⋮ Algebraic characterizations of regularity properties in bipartite graphs ⋮ Quantum walks on embeddings ⋮ Developments on spectral characterizations of graphs ⋮ Constructions of \(1\frac{1}{2}\)-designs from symplectic geometry over finite fields ⋮ Symmetric ‐Designs and ‐Difference Sets ⋮ Periodicity of Grover walks on bipartite regular graphs with at most five distinct eigenvalues ⋮ Partial geometric designs from group actions ⋮ The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5 ⋮ Partial geometric designs arising from association schemes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial designs with two singular values. I: Uniform multiplicative designs
- On a class of partially balanced incomplete block designs
- Strongly regular graphs having strongly regular subconstituents
- A characterization of partial geometric designs
- Special partially balanced incomplete block designs and associated graphs
- Partial geometric designs and two-class partially balanced designs
- Nonregular graphs with three eigenvalues
- Small regular graphs with four eigenvalues
- Some characterizations of quasi-symmetric designs with a spread
- A nonregular analogue of conference graphs
- Optimality of partial geometric designs
- Regular graphs with four eigenvalues
- Strongly regular graphs with strongly regular decomposition
