On the p-rank of the adjacency matrices of strongly regular graphs
From MaRDI portal
Publication:685993
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
Cites work
- scientific article; zbMATH DE number 3884175 (Why is no real title available?)
- scientific article; zbMATH DE number 3159593 (Why is no real title available?)
- scientific article; zbMATH DE number 3906699 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 3508638 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3336895 (Why is no real title available?)
- Notes on binary codes related to the \(\mathrm{O}(5,q)\) generalized quadrangle for odd \(q\)
- On the p-rank of the design matrix of a difference set
- Quasi-symmetric designs and the Smith normal form
- The Gewirtz graph: An exercise in the theory of graph spectra
- The regular two-graph on 276 vertices
Cited in
(52)- On some codes from rank 3 primitive actions of the simple Chevalley group \(G_2(q) \)
- The subspace structure of maximum cliques in pseudo-Paley graphs from unions of cyclotomic classes
- On a modular domination game.
- Binary codes of some strongly regular subgraphs of the McLaughlin graph
- The lattice of integral flows and the lattice of integral cuts on a finite graph
- Binary codes from graphs on triples
- Codes from lattice and related graphs, and permutation decoding
- Uniqueness of strongly regular graphs having minimal \(p\)-rank
- Self-orthogonal codes from row orbit matrices of strongly regular graphs
- Binary codes from Paley graphs of prime-power-square order
- A note on the property of an adjoint of the adjacency matrix of strongly regular graphs
- Guessing games on triangle-free graphs
- On the \(p\)-ranks of the adjacency matrices of distance-regular graphs
- Modular adjacency algebras, standard representations, and \(p\)-ranks of cyclotomic association schemes
- Implementing Brouwer's database of strongly regular graphs
- Critical group structure from the parameters of a strongly regular graph
- Representations of finite association schemes
- On the \(p\)-ranks of net graphs
- Permutation decoding for binary codes from lattice graphs
- Codes from neighbourhood designs of the graphs \(\text{GP}(q,\frac{q-1}{2})\) with \(q\) odd
- scientific article; zbMATH DE number 5494051 (Why is no real title available?)
- On the dual binary codes of the triangular graphs
- Some results on skew Hadamard difference sets
- Graph switching, 2-ranks, and graphical Hadamard matrices
- Linear codes and doubly transitive symmetric designs
- Diagonal forms of incidence matrices associated with \(t\)-uniform hypergraphs
- Permutation decoding for the binary codes from triangular graphs.
- \(LCD\) codes from adjacency matrices of graphs
- A survey of semisimple algebras in algebraic combinatorics
- The Smith and critical groups of the square rook's graph and its complement
- Chip-firing and the critical group of a graph
- Switched symplectic graphs and their 2-ranks
- On the nullspace of arc-transitive graphs over finite fields
- The uniformity space of hypergraphs and its applications
- Designs and codes from involutions of An
- The nullity and ranks of the lexicographic product of strongly regular graphs
- On modular standard modules of association schemes
- Frames over finite fields: equiangular lines in orthogonal geometry
- Hulls of codes from incidence matrices of connected regular graphs
- Pseudo-Paley graphs and skew Hadamard difference sets from presemifields
- The critical group of the Kneser graph on 2-subsets of an \(n\)-element set
- Eigenvalues and critical groups of Adinkras
- Regular LDPC codes from semipartial geometries
- Binary codes and partial permutation decoding sets from biadjacency matrices of bipartite graphs \(\Gamma (2k, k, k + 1, 1)\)
- On the critical group of the missing Moore graph
- The Smith and critical groups of Paley graphs
- On self-orthogonal designs and codes related to Held's simple group
- On the codes related to the Higman-Sims graph
- Odd covers of graphs
- Ternary codes from the strongly regular \((45, 12, 3, 3)\) graphs and orbit matrices of 2-\((45, 12, 3)\) designs
- New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs
- A projective two-weight code related to the simple group \(\mathrm{Co}_1\) of Conway
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)
