The Smith and critical groups of the square rook's graph and its complement
From MaRDI portal
(Redirected from Publication:727178)
Abstract: Let denote the graph with vertex set consisting of the squares of an grid, with two squares of the grid adjacent when they lie in the same row or column. This is the square rook's graph, and can also be thought of as the Cartesian product of two complete graphs of order , or the line graph of the complete bipartite graph . In this paper we compute the Smith group and critical group of the graph and its complement. This is equivalent to determining the Smith normal form of both the adjacency and Laplacian matrix of each of these graphs. In doing so we verify a 1986 conjecture of Rushanan.
Recommendations
Cites work
- A diagonal form for the incidence matrices of \(t\)-subsets vs. \(k\)- subsets
- A finite group attached to the laplacian of a graph
- A short proof of Gamas's theorem
- Chip-firing and the critical group of a graph
- On the Line-Graph of the Complete Bigraph
- On the \(p\)-rank of the adjacency matrices of strongly regular graphs
- Smith normal form and Laplacians
- Smith normal forms of incidence matrices
- Spectra of graphs
- The Uniqueness of the $\mathrm{L}_2$ Association Scheme
Cited in
(9)- The Smith group of the hypercube graph
- Sandpile groups for cones over trees
- Critical groups of Van Lint-Schrijver cyclotomic strongly regular graphs
- Critical group structure from the parameters of a strongly regular graph
- Graphs with few trivial characteristic ideals
- Critical groups of strongly regular graphs and their generalizations
- Difference families, skew Hadamard matrices, and critical groups of doubly regular tournaments
- Chip-firing games and critical groups
- Digraphs with at most one trivial critical ideal
This page was built for publication: The Smith and critical groups of the square rook's graph and its complement
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q727178)