Related papers: Proving relations between modular graph functions
Along the recently trodden path of studying certain number theoretic properties of gauge theories, especially supersymmetric theories whose vacuum manifolds are non-trivial, we investigate Ihara's Graph Zeta Function for large classes of…
We consider supergravity configuration of D5 branes wrapped on supersymmetric 2-cycles and use it to calculate one-point and two-point Green functions of some special operators in N=2 super Yang-Mills theory. We show that Green functions…
Proper graph coloring assigns different colors to adjacent vertices of the graph. Usually, the number of colors is fixed or as small as possible. Consider applications (e.g. variants of scheduling) where colors represent limited resources…
Over all graphs (or unicyclic graphs) of a given order, we characterise those graphs that minimise or maximise the number of connected induced subgraphs. For each of these classes, we find that the graphs that minimise the number of…
We say that a graph is intrinsically non-trivial if every spatial embedding of the graph contains a non-trivial spatial subgraph. We prove that an intrinsically non-trivial graph is intrinsically linked, namely every spatial embedding of…
We show how few-particle Green's functions can be calculated efficiently for models with nearest-neighbor hopping, for infinite lattices in any dimension. As an example, for one dimensional spinless fermions with both nearest-neighbor and…
We show that if a graph is k-edge-connected, and we adjoin to it another graph satisfying a "contracted diameter less or equal to 2" condition, with minimal degree greater or equal to k, and some natural hypothesis on the edges connecting…
A chorded cycle in a graph $G$ is a cycle on which two nonadjacent vertices are adjacent in the graph $G$. In 2010, Gao and Qiao independently proved a graph of order at least $4s$, in which the neighborhood union of any two nonadjacent…
This paper is about the orbifold theory for vertex operator superalgebras. Given a vertex operator superalgebra V and a finite automorphism group G of V, we show that the trace functions associated to the twisted sectors are holomorphic in…
We investigate generating functions for the integrals over world-sheet tori appearing in closed-string one-loop amplitudes of bosonic, heterotic and type-II theories. These closed-string integrals are shown to obey homogeneous and linear…
Here we review the many aspects and distinct phenomena associated to quantum dynamics on general graph structures. For so, we discuss such class of systems under the energy domain Green's function ($G$) framework. This approach is…
In this article we define a minor relation, which is stronger than the classical one, but too strong to become a well-quasi-order on the class of finite graphs. Nevertheless, with this terminology we are able to introduce a conjecture,…
Many real-world complex networks are best modeled as bipartite (or 2-mode) graphs, where nodes are divided into two sets with links connecting one side to the other. However, there is currently a lack of methods to analyze properly such…
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…
Let $(X,\mathcal{R})$ be a commutative association scheme and let $\Gamma=(X,R\cup R^\top)$ be a connected undirected graph where $R\in \mathcal{R}$. Godsil (resp., Brouwer) conjectured that the edge connectivity (resp., vertex…
In this paper, we provide the notions of connection $1$-forms and curvature $2$-forms on graphs. We prove a Weitzenb\"ock formula for connection Laplacians in this setting. We also define a discrete Yang-Mills functional and study its…
We recall several known results about minimally 2-connected graphs, and show that they all follow from a decomposition theorem. Starting from an analogy with critically 2-connected graphs, we give structural characterizations of the classes…
Among all simple 2-connected graphs, and among all $\theta$-graphs, the graphs with the minimum algebraic connectivity are completely determined, respectively.
We give a new proof of the non-triviality of wheel graph homology classes using higher operations on Lie graph homology and a derived version of Koszul duality for modular operads.
The Mercedes diagram has four trivalent vertices which are connected by six links such that they form the edges of a tetrahedron. This three loop Feynman diagram contributes to the D^{12} R^4 amplitude at genus one in type II string theory,…