On the \(p\)-ranks of net graphs

DOI10.1007/BF01397667zbMath0820.05062OpenAlexW2097971204MaRDI QIDQ1345137

René Peeters

Publication date: 26 February 1995

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01397667

zbMATH Keywords

strongly regular graphadjacency matrix\(p\)-ranksmatrixcolinearity graphnet graph

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30) Orthogonal arrays, Latin squares, Room squares (05B15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

Pseudo-Paley graphs and skew Hadamard difference sets from presemifields ⋮ Orthogonal representations over finite fields and the chromatic number of graphs ⋮ Binary codes from Paley graphs of prime-power-square order ⋮ Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint ⋮ On the \(p\)-ranks of the adjacency matrices of distance-regular graphs

Cites Work

• Unnamed Item
• Unnamed Item
• On the \(p\)-rank of the adjacency matrices of strongly regular graphs
• Characters of finite quasigroups
• Characters of finite quasigroups. VI: Critical examples and doubletons
• Characters of finite quasigroups. II: Induced characters
• Characters of finite quasigroups. III: Quotients and fusion
• Characters of finite quasigroups. IV: Products and superschemes
• Bruck nets, codes, and characters of loops
• Latin squares. New developments in the theory and applications
• Nets and their codes
• Characters of finite quasigroups. V: Linear characters
• Finite nets. II: Uniqueness and imbedding