On the sandpile group of the square cycle C^2_n
From MaRDI portal
Publication:855535
DOI10.1016/J.LAA.2006.02.022zbMATH Open1108.05062OpenAlexW2027744479MaRDI QIDQ855535FDOQ855535
Authors: Pingge Chen, Yaoping Hou, Ching-Wah Woo
Publication date: 7 December 2006
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2006.02.022
Recommendations
- scientific article; zbMATH DE number 7339207
- On the sandpile group of \(P_{4}\times C_n\)
- Sandpile group on the graph \(\mathcal D_n\) of the dihedral group
- The sandpile groups of chain-cyclic graphs
- The sandpile group of a thick cycle graph
- On the sandpile group of a family of graphs
- On the sandpile group of the graph \(K_{3}\times C_n\)
- On the identity of the sandpile group
- On the sandpile group of the cone of a graph
- The sandpile group of a family of nearly complete graphs
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)
Cites Work
- Chip-firing and the critical group of a graph
- On the sandpile group of dual graphs
- Self-organized criticality
- Algebraic aspects of Abelian sandpile models
- Spécialisation du foncteur de Picard
- Arithmetical graphs
- A finite group attached to the laplacian of a graph
- Unimodular equivalence of graphs
- The number of spanning trees in circulant graphs
- On the critical group of the Möbius ladder graph
- Title not available (Why is that?)
- Sandpile group on the graph \(\mathcal D_n\) of the dihedral group
- The critical group of a threshold graph
- Critical groups for complete multipartite graphs and Cartesian products of complete graphs
- Counting Trees in a Certain Class of Graphs
- A simple proof for the complexity of the square cycle \(C^ 2_ p\).
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (31)
- The critical group of a clique-inserted graph
- On the sandpile group of \(P_{4}\times C_n\)
- Title not available (Why is that?)
- On Jacobian group and complexity of the generalized Petersen graph \(\mathrm{GP}(n,k)\) through Chebyshev polynomials
- Title not available (Why is that?)
- The critical group of \(K_{m} \times C_{n}\)
- On the sandpile group of a family of graphs
- The critical group of \(K_m \times P_n\)
- Smith normal form and Laplacians
- Sandpile group on the graph \(\mathcal D_n\) of the dihedral group
- On the sandpile group of Eulerian series-parallel graphs
- The sandpile groups of chain-cyclic graphs
- The sandpile group of a tree
- Asymptotics and arithmetical properties of complexity for circulant graphs
- On the sandpile group of the graph \(K_{3}\times C_n\)
- Random walks, electric networks and the transience class problem of sandpiles
- Sandpile groups of Cayley graphs of 𝔽 r 2
- On graph parameters guaranteeing fast sandpile diffusion
- Cyclic coverings of graphs. Counting rooted spanning forests and trees, Kirchhoff index, and Jacobians
- The sandpile group of polygon rings and twisted polygon rings
- The sandpile group of a polygon flower
- Sandpile groups of generalized de Bruijn and Kautz graphs and circulant matrices over finite fields
- The sandpile group of a bilateral regular tree
- On the sandpile model of modified wheels. II
- On the structure of the Jacobian group for circulant graphs
- On the sandpile group of \(3\times n\) twisted bracelets
- Applying the Kirchhoff relations in proofs of theorems on graph operations that do not affect the structure of the sandpile groups of graphs
- The sandpile group of a thick cycle graph
- On the Jacobian group of a cone over a circulant graph
- On Jacobian group and complexity of \(I\)-graph \(I(n, k, l)\) through Chebyshev polynomials
- Chip-firing games and critical groups
This page was built for publication: On the sandpile group of the square cycle \(C^{2}_{n}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q855535)