Add to ORKGIn this note, we describe a construction that leads to families of graphs whose critical groups are cyclic. For some of these families we are able to give a formula for the number of spanning trees of the graph, which then determines the group exactly
AbstractIn this paper, we will show that the structure of the critical group of the graph Km×Pn is Z...
In this paper, we derive new formulas for the number of spanning trees of a specific family of graph...
51 pages, 24 figuresFisher established an explicit correspondence between the 2-dimensional Ising mo...
AbstractThe critical group of a connected graph is a finite abelian group, whose order is the number...
The critical group of a connected graph is a nite abelian group, whose order is the number of span...
Abstract. We generalize the theory of critical groups from graphs to sim-plicial complexes. Specific...
In this thesis, we explore elliptic curves from a combinatorial viewpoint. Given an elliptic curve E...
AbstractIn this paper the weighted fundamental circuits intersection matrix of an edge-labeled graph...
In this note we introduce a finite abelian group that can be associated with any finite connected gr...
AbstractThe sandpile group of a graph is a refinement of the number of spanning trees of the graph a...
AbstractA graph on n vertices is called circular if its automorphism group contains an n-cycle. Let ...
An infinite class of graph-theoretic binary cyclic codes is presented. Although such codes are struc...
AbstractIn this paper, we derive new formulas for the number of spanning trees of a specific family ...
Let G be a finite, connected graph. An arithmetical structure on G is a pair of positive integer vec...
A graph on n vertices is called circular if its automorphism group contains an n-cycle. Let ω(G) and...
AbstractIn this paper, we will show that the structure of the critical group of the graph Km×Pn is Z...
In this paper, we derive new formulas for the number of spanning trees of a specific family of graph...
51 pages, 24 figuresFisher established an explicit correspondence between the 2-dimensional Ising mo...
AbstractThe critical group of a connected graph is a finite abelian group, whose order is the number...
The critical group of a connected graph is a nite abelian group, whose order is the number of span...
Abstract. We generalize the theory of critical groups from graphs to sim-plicial complexes. Specific...
In this thesis, we explore elliptic curves from a combinatorial viewpoint. Given an elliptic curve E...
AbstractIn this paper the weighted fundamental circuits intersection matrix of an edge-labeled graph...
In this note we introduce a finite abelian group that can be associated with any finite connected gr...
AbstractThe sandpile group of a graph is a refinement of the number of spanning trees of the graph a...
AbstractA graph on n vertices is called circular if its automorphism group contains an n-cycle. Let ...
An infinite class of graph-theoretic binary cyclic codes is presented. Although such codes are struc...
AbstractIn this paper, we derive new formulas for the number of spanning trees of a specific family ...
Let G be a finite, connected graph. An arithmetical structure on G is a pair of positive integer vec...
A graph on n vertices is called circular if its automorphism group contains an n-cycle. Let ω(G) and...
AbstractIn this paper, we will show that the structure of the critical group of the graph Km×Pn is Z...
In this paper, we derive new formulas for the number of spanning trees of a specific family of graph...
51 pages, 24 figuresFisher established an explicit correspondence between the 2-dimensional Ising mo...