Abstract
We study free scalar field theory on a graph, which gives rise to a modified version of discrete Green's function on a graph studied in \cite{CY}. We show that this gives rise to a graph invariant, which is closely related to the 2-dim Weisfeiler-Lehman algorithm for graph isomorphism testing. We complement this invariant by another type of graph invariants, coming from viewing graphs as quadratic forms over the integers. We explain that the combination of these two ideas give rise to an interesting approach to the graph isomorphism problem.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.