Bicycles and Spanning Trees

DOI10.1137/0607001zbMath0588.05016OpenAlexW1982253010MaRDI QIDQ3715129

Kenneth A. Berman

Publication date: 1986

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0607001

zbMATH Keywords

Abelian groupplanar graphunique factorizationdual graphspanning tree numberconnected multigraphk-bicycle

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items

No Laplacian Perfect State Transfer in Trees ⋮ The sandpile group of a thick cycle graph ⋮ Balanced vertex weightings and arborescences ⋮ Quantitative Néron theory for torsion bundles ⋮ Generalized bicycles ⋮ The structure of sandpile groups of outerplanar graphs ⋮ Critical groups of covering, voltage and signed graphs ⋮ The critical group of a clique-inserted graph ⋮ Chip-Firing Games and Critical Groups ⋮ Graph coverings and twisted operators ⋮ Dual graphs and knot invariants ⋮ On the sandpile group of the cone of a graph ⋮ The lattice of integral flows and the lattice of integral cuts on a finite graph ⋮ Algebraic Properties of Generalized Graph Laplacians: Resistor Networks, Critical Groups, and Homological Algebra ⋮ A note on Dehn colorings and invariant factors ⋮ Unimodular equivalence of graphs ⋮ Smith normal form and Laplacians ⋮ Critical groups for homeomorphism classes of graphs ⋮ On the minors of an incidence matrix and Smith normal form ⋮ Unnamed Item ⋮ The sandpile group of a polygon flower ⋮ Laplacian matrices of graphs: A survey ⋮ The critical group of a threshold graph

Cites Work

• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• Matrix Generalizations of Some Theorems on Trees, Cycles and Cocycles in Graphs
• On the Principal Edge Tripartition of a Graph
• On Vector Spaces Associated with a Graph
• Graph property recognition machines
• On the Imbedding of Linear Graphs in Surfaces
• A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item