2014
DOI: 10.1007/s10801-014-0563-0
|View full text |Cite
|
Sign up to set email alerts
|

The Smith and critical groups of Paley graphs

Abstract: There is a Paley graph for each prime power q such that q ≡ 1 (mod 4). The vertex set is the field F q , and two vertices x and y are joined by an edge if and only if x − y is a nonzero square of F q . We compute the Smith normal forms of the adjacency matrix and Laplacian matrix of a Paley graph.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
32
1

Year Published

2016
2016
2024
2024

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 25 publications
(33 citation statements)
references
References 14 publications
0
32
1
Order By: Relevance
“…The cokernel of the adjacency matrix is called the Smith group, and has been studied e.g. in [CSX14,DJ13].…”
Section: Introductionmentioning
confidence: 99%
“…The cokernel of the adjacency matrix is called the Smith group, and has been studied e.g. in [CSX14,DJ13].…”
Section: Introductionmentioning
confidence: 99%
“…The critical groups of many classes of graphs have been computed. As a couple of nice examples, we mention threshold graphs (work of B. Jacobson [24]) and Paley graphs (D. B. Chandler, P. Sin, and Q. Xiang [9]). Critical groups have been generalized in various ways.…”
Section: Note a Similar Trick Work For The Matrixmentioning
confidence: 99%
“…If Q v is the matrix obtained by deleting the vth row and vth column of Q, then the Matrix-tree theorem (eg. [22,5.64 and 5.68]) states that |det(Q v )| is the number of oriented trees in Γ with root v. If Γ is a directed Eulerian graph, det(Q v ) is independent of the vertex v and |K| = |det(Q v )|. If Γ is undirected, |K| = |det(Q v )| is the number of spanning trees of Γ.…”
mentioning
confidence: 99%