On the \(p\)-rank of the adjacency matrices of strongly regular graphs
From MaRDI portal
Publication:685993
DOI10.1023/A:1022438616684zbMath0780.05039MaRDI QIDQ685993
Andries E. Brouwer, C. A. van Eijl
Publication date: 16 January 1994
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items
Guessing games on triangle-free graphs, Codes from neighbourhood designs of the graphs \(\text{GP}(q,\frac{q-1}{2})\) with \(q\) odd, Implementing Brouwer's database of strongly regular graphs, On the \(p\)-ranks of net graphs, Switched symplectic graphs and their 2-ranks, A projective two-weight code related to the simple group \(\mathrm{Co}_1\) of Conway, Pseudo-Paley graphs and skew Hadamard difference sets from presemifields, Uniqueness of strongly regular graphs having minimal \(p\)-rank, Linear codes and doubly transitive symmetric designs, \(LCD\) codes from adjacency matrices of graphs, On the dual binary codes of the triangular graphs, Unnamed Item, Modular adjacency algebras, standard representations, and \(p\)-ranks of cyclotomic association schemes, New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs, Codes from lattice and related graphs, and permutation decoding, Designs and codes from involutions of An, Binary codes of some strongly regular subgraphs of the McLaughlin graph, Odd covers of graphs, On some codes from rank 3 primitive actions of the simple Chevalley group \(G_2(q) \), Binary codes and partial permutation decoding sets from biadjacency matrices of bipartite graphs Γ(2k, k, k + 1, 1), Hulls of codes from incidence matrices of connected regular graphs, Permutation decoding for the binary codes from triangular graphs., Ternary codes from the strongly regular \((45, 12, 3, 3)\) graphs and orbit matrices of 2-\((45, 12, 3)\) designs, On a modular domination game., Permutation decoding for binary codes from lattice graphs, Regular LDPC codes from semipartial geometries, Critical group structure from the parameters of a strongly regular graph, The lattice of integral flows and the lattice of integral cuts on a finite graph, The critical group of the Kneser graph on 2-subsets of an \(n\)-element set, On the critical group of the missing Moore graph, On the nullspace of arc-transitive graphs over finite fields, On the codes related to the Higman-Sims graph, On modular standard modules of association schemes, On self-orthogonal designs and codes related to Held's simple group, The Smith and critical groups of the square rook's graph and its complement, Diagonal forms of incidence matrices associated with \(t\)-uniform hypergraphs, Some results on skew Hadamard difference sets, A survey of semisimple algebras in algebraic combinatorics, Graph switching, 2-ranks, and graphical Hadamard matrices, Chip-firing and the critical group of a graph, Binary codes from graphs on triples, Frames over finite fields: equiangular lines in orthogonal geometry, Representations of finite association schemes, Binary codes from Paley graphs of prime-power-square order, The uniformity space of hypergraphs and its applications, On the \(p\)-ranks of the adjacency matrices of distance-regular graphs, Eigenvalues and critical groups of Adinkras, The Smith and critical groups of Paley graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Notes on binary codes related to the \(\mathrm{O}(5,q)\) generalized quadrangle for odd \(q\)
- Quasi-symmetric designs and the Smith normal form
- The regular two-graph on 276 vertices
- The Gewirtz graph: An exercise in the theory of graph spectra
- On the p-rank of the design matrix of a difference set
