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

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the \(p\)-ranks of net graphs
scientific article

    Statements

    On the \(p\)-ranks of net graphs (English)
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references