On the p-rank of the adjacency matrices of strongly regular graphs

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
The Gewirtz graph: An exercise in the theory of graph spectra
Title not available (Why is that?)
On the p-rank of the design matrix of a difference set
Notes on binary codes related to the \(\mathrm{O}(5,q)\) generalized quadrangle for odd \(q\)
Title not available (Why is that?)
The regular two-graph on 276 vertices
Quasi-symmetric designs and the Smith normal form
Title not available (Why is that?)

Cited In (50)

The subspace structure of maximum cliques in pseudo-Paley graphs from unions of cyclotomic classes
On some codes from rank 3 primitive actions of the simple Chevalley group \(G_2(q) \)
Odd covers of graphs
Title not available (Why is that?)
Permutation decoding for the binary codes from triangular graphs.
Eigenvalues and critical groups of Adinkras
Binary codes from Paley graphs of prime-power-square order
Binary codes from graphs on triples
Critical group structure from the parameters of a strongly regular graph
Some results on skew Hadamard difference sets
Linear codes and doubly transitive symmetric designs
Guessing games on triangle-free graphs
The critical group of the Kneser graph on 2-subsets of an \(n\)-element set
Binary codes and partial permutation decoding sets from biadjacency matrices of bipartite graphs Γ(2k, k, k + 1, 1)
On the dual binary codes of the triangular graphs
Designs and codes from involutions of A_n
Chip-firing and the critical group of a graph
On the codes related to the Higman-Sims graph
Binary codes of some strongly regular subgraphs of the McLaughlin graph
Graph switching, 2-ranks, and graphical Hadamard matrices
Modular adjacency algebras, standard representations, and \(p\)-ranks of cyclotomic association schemes
On the nullspace of arc-transitive graphs over finite fields
Regular LDPC codes from semipartial geometries
Representations of finite association schemes
The Smith and critical groups of the square rook's graph and its complement
Switched symplectic graphs and their 2-ranks
On a modular domination game.
\(LCD\) codes from adjacency matrices of graphs
Hulls of codes from incidence matrices of connected regular graphs
Ternary codes from the strongly regular \((45, 12, 3, 3)\) graphs and orbit matrices of 2-\((45, 12, 3)\) designs
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
On self-orthogonal designs and codes related to Held's simple group
Codes from neighbourhood designs of the graphs \(\text{GP}(q,\frac{q-1}{2})\) with \(q\) odd
New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs
Uniqueness of strongly regular graphs having minimal \(p\)-rank
The uniformity space of hypergraphs and its applications
On the \(p\)-ranks of net graphs
Frames over finite fields: equiangular lines in orthogonal geometry
The Smith and critical groups of Paley graphs
Implementing Brouwer's database of strongly regular graphs
A survey of semisimple algebras in algebraic combinatorics
On the critical group of the missing Moore graph
Codes from lattice and related graphs, and permutation decoding
On the \(p\)-ranks of the adjacency matrices of distance-regular graphs
Title not available (Why is that?)
Diagonal forms of incidence matrices associated with \(t\)-uniform hypergraphs
Permutation decoding for binary codes from lattice graphs
On modular standard modules of association schemes
The lattice of integral flows and the lattice of integral cuts on a finite graph

   Recommendations

Uniqueness of strongly regular graphs having minimal \(p\)-rank 👍 👎
On the \(p\)-ranks of the adjacency matrices of distance-regular graphs 👍 👎
On strongly regular graphs of order \(6(2p+1)\) where \(2p+1\) is a prime number 👍 👎
On the \(p\)-ranks of net graphs 👍 👎
On strongly regular graphs of order \(5(2p+1)\) where \(2p+1\) is a prime number 👍 👎

This page was built for publication: On the \(p\)-rank of the adjacency matrices of strongly regular graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685993)