The following pages link to On the \(p\)-ranks of net graphs (Q1345137):
Displaying 6 items.
- On the \(p\)-rank of the adjacency matrices of strongly regular graphs (Q685993) (← links)
- On the \(p\)-ranks of the adjacency matrices of distance-regular graphs (Q1597524) (← links)
- Binary codes from Paley graphs of prime-power-square order (Q2329171) (← links)
- Pseudo-Paley graphs and skew Hadamard difference sets from presemifields (Q2384030) (← links)
- Orthogonal representations over finite fields and the chromatic number of graphs (Q2563517) (← links)
- Complexity of the Positive Semidefinite Matrix Completion Problem with a Rank Constraint (Q2848995) (← links)
