Random strongly regular graphs?
From MaRDI portal
Publication:5907044
DOI10.1016/S0012-365X(03)00231-0zbMath1034.05043OpenAlexW2138013229MaRDI QIDQ5907044
Publication date: 5 January 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00231-0
Random graphs (graph-theoretic aspects) (05C80) Association schemes, strongly regular graphs (05E30) Orthogonal arrays, Latin squares, Room squares (05B15) Triple systems (05B07)
Related Items
Disconnecting strongly regular graphs, Switching for Small Strongly Regular Graphs, Identifying codes in vertex-transitive graphs and strongly regular graphs, The geometry of diagonal groups, The extendability of matchings in strongly regular graphs, Switching codes and designs, The cycle switching graph of the Steiner triple systems of order 19 is connected, Developments on spectral characterizations of graphs, On a conjecture of Brouwer involving the connectivity of strongly regular graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A prolific construction of strongly regular graphs with the \(n\)-e. c. property
- Exponential numbers of two-weight codes, difference sets and symmetric designs
- Graphs which contain all small graphs
- Strongly regular graphs with smallest eigenvalue -m
- Most Latin squares have many subsquares
- Maximising the permanent of \((0,1)\)-matrices and the number of extensions of Latin rectangles
- Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
- Nonisomorphic Steiner triple systems
- Strongly regular graphs, partial geometries and partially balanced designs
- Almost All Steiner Triple Systems Are Asymmetric
- Generating uniformly distributed random latin squares
- Construction of strongly regular graphs using affine designs
- Random strongly regular graphs?
- Asymptotic enumeration of Latin rectangles
