Approximately strongly regular graphs
From MaRDI portal
Publication:2111940
DOI10.1016/J.DISC.2022.113299OpenAlexW4313498849MaRDI QIDQ2111940FDOQ2111940
Publication date: 17 January 2023
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2205.05792
Extremal problems in graph theory (05C35) Combinatorial aspects of block designs (05B05) Association schemes, strongly regular graphs (05E30) Linear codes and caps in Galois spaces (51E22)
Cites Work
- Fast generation of regular graphs and construction of cages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Interlacing eigenvalues and graphs
- Recursive constructions for large caps
- Title not available (Why is that?)
- Paths in graphs
- Large caps in small spaces
- Title not available (Why is that?)
- A note on Ramsey numbers
- An asymptotic existence result on compressed sensing matrices
- Spherical codes and designs
- Title not available (Why is that?)
- The early evolution of the \(H\)-free process
- Constructive bounds for a Ramsey-type problem
- Extensions of generalized product caps
- Explicit Ramsey graphs and orthonormal labelings
- On \(k\)-walk-regular graphs
- On large subsets of \(\mathbb{F}_q^n\) with no three-term arithmetic progression
- Graphs which contain all small graphs
- On quasi-strongly regular graphs
- Strongly Regular Graphs
- Title not available (Why is that?)
- Reaching a Quantum Consensus: Master Equations that Generate Symmetrization and Synchronization
- A construction for clique-free pseudorandom graphs
Cited In (2)
Uses Software
Recommendations
This page was built for publication: Approximately strongly regular graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111940)
