The lattice of cycles of an undirected graph

G Averkov,A Chavez,J.A De Loera,B Gillespie

doi:10.1016/j.laa.2020.10.027

The lattice of cycles of an undirected graph

G Averkov, A Chavez + Show 2 more

Open Access

https://doi.org/10.1016/j.laa.2020.10.027

Copy DOI

Journal: Linear Algebra and Its Applications	Publication Date: Oct 27, 2020
Citations: 1	License type: publisher-specific-oa

Affiliation: University of California, Davis, Colorado State University, Brandenburg University of Technology Cottbus-Senftenberg

#Arbitrary Abelian Group #General Setting + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

We study bases of the lattice generated by the cycles of an undirected graph, defined as the integer linear combinations of the 0/1-incidence vectors of cycles. We prove structural results for this lattice, including explicit formulas for its dimension and determinant, and we present efficient algorithms to construct lattice bases, using only cycles as generators, in quadratic time. By algebraic considerations, we relate these results to the more general setting with coefficients from an arbitrary Abelian group. Our results generalize classical results for the vector space of cycles of a graph over the binary field to the case of an arbitrary field.

Full Text