The Laplacian lattice of a graph under a simplicial distance function

DOI10.1016/j.ejc.2013.01.010zbMath1285.05091arXiv1111.7246MaRDI QIDQ2444735

Madhusudan Manjunath

Publication date: 11 April 2014

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1111.7246

zbMATH Keywords

packing densities; covering densities; Laplacian lattices of undirected connected multigraphs

Mathematics Subject Classification ID

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

Related Items

Voronoi polytopes for polyhedral norms on lattices, Brill-Noether existence on graphs via \(\mathbb{R}\)-divisors, polytopes and lattices, On Laplacian Monopoles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Applications of dimensionality reduction and exponential sums to graph automorphism
• Torelli theorem for graphs and tropical curves
• Riemann-Roch for sub-lattices of the root lattice \(A_n\)
• Monomials, binomials and Riemann-Roch
• Riemann-Roch and Abel-Jacobi theory on a finite graph
• Primer for the algebraic geometry of sandpiles
• Expander graphs and their applications
• Matrix Analysis
• The lattice of integral flows and the lattice of integral cuts on a finite graph
• Trees, parking functions, syzygies, and deformations of monomial ideals