The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf
.
The Laplacian lattice of a graph under a simplicial distance function
[article]
2011
arXiv
pre-print
We provide a complete description of important geometric invariants of the Laplacian lattice of a multigraph under the distance function induced by a regular simplex, namely Voronoi Diagram, Delaunay Triangulation, Delaunay Polytope and its combinatorial structure, Shortest Vectors, Covering and Packing Radius. We use this information to obtain the following results: i. Every multigraph defines a Delaunay triangulation of its Laplacian lattice and this Delaunay triangulation contains complete
arXiv:1111.7246v1
fatcat:6uq4jlceqvbstlnla2kx2nawnm