On the \(p\)-ranks of the adjacency matrices of distance-regular graphs

DOI10.1023/A:1013842904024zbMath0989.05074MaRDI QIDQ1597524

René Peeters

Publication date: 30 May 2002

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

zbMATH Keywords

distance-regular graphadjacency matrixminimal polynomial\(p\)-rank

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

Related Items

Codes from neighbourhood designs of the graphs \(\text{GP}(q,\frac{q-1}{2})\) with \(q\) odd ⋮ A modular absolute bound condition for primitive association schemes ⋮ Modular adjacency algebras, standard representations, and \(p\)-ranks of cyclotomic association schemes ⋮ Codes from lattice and related graphs, and permutation decoding ⋮ Codes from adjacency matrices of uniform subset graphs ⋮ Hulls of codes from incidence matrices of connected regular graphs ⋮ Enumeration of cospectral and coinvariant graphs ⋮ Hamming graphs and special LCD codes ⋮ On modular standard modules of association schemes ⋮ Graphs, designs and codes related to the \(n\)-cube ⋮ Representations of finite association schemes ⋮ Binary codes from reflexive uniform subset graphs on 3-sets

Cites Work

• Unnamed Item
• Unnamed Item
• On the \(p\)-rank of the adjacency matrices of strongly regular graphs
• Ovoids and fans in the generalized quadrangle Q(4,2)
• Distance regular graphs of diameter 3 and strongly regular graphs
• On the \(p\)-ranks of net graphs
• A diagonal form for the incidence matrices of \(t\)-subsets vs. \(k\)- subsets
• Uniqueness of strongly regular graphs having minimal \(p\)-rank
• Regular graphs with four eigenvalues
• Distance-regularity and the spectrum of graphs
• Graphs cospectral with distance-regular graphs

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