Related papers: Graph invariants from ideas in physics and number …
In this work we introduce an energy function in order to study finite scale free graphs generated with different models. The energy distribution has a fractal pattern and presents log periodic oscillations for high energies. This…
The $c_2$ invariant is an arithmetic graph invariant introduced by Schnetz and developed by Brown and Schnetz in order to better understand Feynman integrals. This document looks at the special case where the graph in question is a…
By using the path integral method , we calculate the Green functions of field strength of Yang-Mills theories on arbitrary nonorientable surfaces in Schwinger-Fock gauge. We show that the non-gauge invariant correlators consist of a free…
Graphene on two dimensional (2D) noncommutative (NC) plane in the presence of a constant background magnetic field has been studied. To handel the gauge-invariance issue we start our analysis by a effective massles NC Dirac field theory…
The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…
We present a formalism for analysis of linear Cauchy data on a Kottler metric. Our method removes redundancy due to gauge transformations and constraints. A set of four gauge-invariant, scalar functions on the Cauchy surface is produced and…
It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…
We consider two-dimensional N=(2,2) supersymmetric gauge theory on discretized Riemann surfaces. We find that the discretized theory can be efficiently described by using graph theory, where the bosonic and fermionic fields are regarded as…
These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…
The isomorphism problem is a fundamental problem in network analysis, which involves capturing both low-order and high-order structural information. In terms of extracting low-order structural information, graph isomorphism algorithms…
The theory of graphons has proven to be a powerful tool in many areas of graph theory. In this paper, we introduce several foundational aspects of the theory of digraphons -- asymmetric two-variable functions that arise as limits of…
Two simple undirected graphs are cospectral if their respective adjacency matrices have the same multiset of eigenvalues. Cospectrality yields an equivalence relation on the family of graphs which is provably weaker than isomorphism. In…
In this note we elaborate on some notions of surface area for discrete graphs which are closely related to the inverse degree. These notions then naturally lead to associated connectivity measures of graphs and to the definition of a…
We introduce a type of graph integrals which are holomorphic analogs of configuration space integrals. We prove their (ultraviolet) finiteness by considering a compactification of the moduli space of graphs with metrics, and study their…
We introduce invariants of spatial graphs related to the Wu invariant and the Simon invariant, and apply them to prove that certain graphs are intrinsically chiral, and to obtain lower bounds for the minimal crossing number of embedded…
Combining the study of the simple random walk on graphs, generating functions (especially Green functions), complex dynamics and general complex analysis we introduce a new method of spectral analysis on self-similar graphs. We give an…
A free massive scalar field in inhomogeneous random media is investigated. The coefficients of the Klein-Gordon equation are taken to be random functions of the spatial coordinates. The case of an annealed-like disordered medium, modeled by…
In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…
We show how to define invariants of graphs related to quantum $\mathfrak{sl}(2)$ when the graph has more then one connected component and components are colored by blocks of representations with zero quantum dimensions.
In this paper we investigate the connectedness and the isomorphism problems for zig-zag products of two graphs. A sufficient condition for the zig-zag product of two graphs to be connected is provided, reducing to the study of the…