Critical group structure from the parameters of a strongly regular graph
From MaRDI portal
Publication:2229192
Abstract: We give simple arithmetic conditions that force the Sylow -subgroup of the critical group of a strongly regular graph to take a specific form. These conditions depend only on the parameters of the strongly regular graph under consideration. We give many examples, including how the theory can be used to compute the critical group of Conway's -graph and to give an elementary argument that no exists.
Recommendations
Cites work
- scientific article; zbMATH DE number 874569 (Why is no real title available?)
- A finite group attached to the laplacian of a graph
- Chip-Firing and Rotor-Routing on Directed Graphs
- Chip-firing and the critical group of a graph
- Chip-firing games and critical groups
- Critical groups of Van Lint-Schrijver cyclotomic strongly regular graphs
- Elementary divisors of graphs and matroids
- On the Jacobian group for Möbius ladder and prism graphs
- On the \(p\)-rank of the adjacency matrices of strongly regular graphs
- On the critical group of the missing Moore graph
- Smith and critical groups of polar graphs
- Smith normal form and Laplacians
- Spectra of graphs
- The CRC handbook of combinatorial designs
- The Smith and critical groups of Paley graphs
- The Smith and critical groups of the square rook's graph and its complement
- The Smith group and the critical group of the Grassmann graph of lines in finite projective space and of its complement
- The critical group of the Kneser graph on 2-subsets of an \(n\)-element set
Cited in
(3)
This page was built for publication: Critical group structure from the parameters of a strongly regular graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229192)