On the \(p\)-ranks of net graphs (Q1345137)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 727320
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the \(p\)-ranks of net graphs |
scientific article; zbMATH DE number 727320 |
Statements
On the \(p\)-ranks of net graphs (English)
0 references
26 February 1995
0 references
The colinearity graph of a \(k\)-net is a strongly regular graph called a net graph. The author studies \(p\)-ranks (i.e. the rank over \(\text{F}_ p\), \(p\) being a prime) of the matrix \(A + kI\) where \(A\) is the adjacency matrix of a net graph.
0 references
\(p\)-ranks
0 references
colinearity graph
0 references
strongly regular graph
0 references
net graph
0 references
matrix
0 references
adjacency matrix
0 references
0.8020310997962952
0 references
0.7992048263549805
0 references
0.7817052006721497
0 references
0.7719622850418091
0 references
