Strongly regular graphs with parameters \((4m^{4},2m^{4}+m^{2},m^{4}+m^{2},m^{4}+m^{2})\) exist for all \(m>1\)
From MaRDI portal
Publication:992782
DOI10.1016/j.ejc.2009.07.009zbMath1225.05252OpenAlexW2034919577MaRDI QIDQ992782
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
Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Association schemes, strongly regular graphs (05E30) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)
Related Items (10)
Implementing Brouwer's database of strongly regular graphs ⋮ Uniform mixing and association schemes ⋮ Non-derivable strongly regular graphs from quasi-symmetric designs ⋮ Divisible design graphs ⋮ Extrema of graph eigenvalues ⋮ On the metric dimension of imprimitive distance-regular graphs ⋮ Extremal norms of graphs and matrices ⋮ On the sum of \(k\) largest singular values of graphs and matrices ⋮ Universal adjacency matrices with two eigenvalues ⋮ Distance–regular graphs having theM-property
Cites Work
- Unnamed Item
- Unnamed Item
- Strongly regular graphs with maximal energy
- A special class of Williamson matrices and difference sets
- Some infinite classes of special Williamson matrices and difference sets
- On the existence of abelian Hadamard difference sets and a new family of difference sets
- Linear codes and the existence of a reversible Hadamard difference set in \(\mathbb{Z}_ 2\times \mathbb{Z}_ 2\times \mathbb{Z}_ 5^ 4\)
- A unifying construction for difference sets
- Symmetric Bush-type Hadamard matrices of order $4m^4$ exist for all odd $m$
- Strongly Regular Graphs Derived from Combinatorial Designs
- Maximal energy graphs
- Constructions of Hadamard difference sets
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\)
