[HTML][HTML] The Laplacian lattice of a graph under a simplicial distance function
M Manjunath - European Journal of Combinatorics, 2013 - Elsevier
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 …
of a multigraph under the distance function induced by a regular simplex, namely Voronoi …
Riemann-Roch theory for sublattices of the root lattice An, graph automorphisms and counting cycles in graphs
M Manjunath - 2011 - publikationen.sulb.uni-saarland.de
This thesis consists of two independent parts. In the rst part of the thesis, we develop a
Riemann-Roch theory for sublattices of the root lattice An extending the work of Baker and …
Riemann-Roch theory for sublattices of the root lattice An extending the work of Baker and …
[PDF][PDF] Using the Eigenvalue Partition to Compute the Automorphism Group
JQ HAO, YZ GONG, HZ LIU - International Journal of Hybrid …, 2016 - gvpress.com
To solve the automorphism group of a graph is a fundamental problem in graph theory.
Moreover, it usually is an essential process for graph isomorphism testing. At present …
Moreover, it usually is an essential process for graph isomorphism testing. At present …