Strongly regular graphs with parameters (4m^4,2m^4+m^2,m^4+m^2,m^4+m^2) exist for all m>1
DOI10.1016/J.EJC.2009.07.009zbMATH Open1225.05252OpenAlexW2034919577MaRDI QIDQ992782FDOQ992782
Authors: Willem H. Haemers, Qing Xiang 
Publication date: 10 September 2010
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2009.07.009
Recommendations
- Two families of strongly regular graphs with the 4-vertex condition
- The strongly regular (40, 12, 2, 4) graphs
- Strongly regular graphs with nonprincipal eigenvalue 4 and its extensions
- scientific article; zbMATH DE number 7176250
- On strongly regular graphs with \(M_2=Qm_3\) and \(M_3=Qm_2\) where \(q\in\mathbb Q\)
- On strongly regular graphs with \(m_2 = qm_3\) and \(m_3 = qm_2\)
- On strongly regular graphs with \(b_1<24\)
- scientific article; zbMATH DE number 1961271
- On strongly regular graphs with μ ≥ 2
- scientific article; zbMATH DE number 1382293
Association schemes, strongly regular graphs (05E30) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20)
Cites Work
- Maximal energy graphs
- Title not available (Why is that?)
- A unifying construction for difference sets
- Combinatorics of symmetric designs
- On the existence of abelian Hadamard difference sets and a new family of difference sets
- Strongly Regular Graphs Derived from Combinatorial Designs
- Strongly regular graphs with maximal energy
- Linear codes and the existence of a reversible Hadamard difference set in \(\mathbb{Z}_ 2\times \mathbb{Z}_ 2\times \mathbb{Z}_ 5^ 4\)
- Constructions of Hadamard difference sets
- Some infinite classes of special Williamson matrices and difference sets
- A special class of Williamson matrices and difference sets
- Symmetric Bush-type Hadamard matrices of order $4m^4$ exist for all odd $m$
Cited In (13)
- On the sum of \(k\) largest singular values of graphs and matrices
- Extrema of graph eigenvalues
- Uniform mixing and association schemes
- Universal adjacency matrices with two eigenvalues
- Hadamard matrices and strongly regular graphs with the 3-e. c. adjacency property
- Distance-regular graphs having the \(M\)-property
- Non-derivable strongly regular graphs from quasi-symmetric designs
- Divisible design graphs
- Extremal norms of graphs and matrices
- Association schemes on triples over few vertices
- On the metric dimension of imprimitive distance-regular graphs
- Implementing Brouwer's database of strongly regular graphs
- Strongly regular graphs with maximal energy
This page was built for publication: Strongly regular graphs with parameters \((4m^{4},2m^{4}+m^{2},m^{4}+m^{2},m^{4}+m^{2})\) exist for all \(m>1\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q992782)
