Related papers: Polynomial graph invariants induced from the ${\ma…
Coverings of undirected graphs are used in distributed computing, and unfoldings of directed graphs in semantics of programs. We study these two notions from a graph theoretical point of view so as to highlight their similarities, as they…
Recently, Chmutov proved that the partial-dual polynomial considered as a function on chord diagrams satisfies the four-term relation. Deng et al. then proved that this function on framed chord diagrams also satisfies the four-term…
In this paper we show that Leavitt path algebras of weighted graphs and Leavitt path algebras of separated graphs are intimately related. We prove that any Leavitt path algebra $L(E,\omega)$ of a row-finite vertex weighted graph…
We present recent advances in harmonic analysis on infinite graphs. Our approach combines combinatorial tools with new results from the theory of unbounded Hermitian operators in Hilbert space, geometry, boundary constructions, and spectral…
We give combinatorial criteria for predicting the transcendental weight of Feynman integrals of certain graphs in $\phi^4$ theory. By studying spanning forest polynomials, we obtain operations on graphs which are weight-preserving, and a…
Binomial Cayley graphs are obtained by considering the binomial coefficient of the weight function of a given Cayley graph and a natural number. We introduce these objects and study two families: one associated with symmetric groups and the…
The graph polynomial for the number of independent sets of size $k$ in a general undirected graph is shown to be equal to an elementary symmetric polynomial of the vertex monomials, which are determined by the edges incident at the…
Current graph neural networks (GNNs) lack generalizability with respect to scales (graph sizes, graph diameters, edge weights, etc..) when solving many graph analysis problems. Taking the perspective of synthesizing graph theory programs,…
Neural networks efficiently encode learned information within their parameters. Consequently, many tasks can be unified by treating neural networks themselves as input data. When doing so, recent studies demonstrated the importance of…
The Kontsevich integral of a knot is a powerful invariant which takes values in an algebra of trivalent graphs with legs. Given a Lie algebra, the Kontsevich integral determines an invariant of knots (the so-called colored Jones function)…
Asymptotic expansions of Gaussian integrals may often be interpreted as generating functions for certain combinatorial objects (graphs with additional data). In this article we discuss a general approach to all such cases using colored…
Presented approach in polynomial time calculates large number of invariants for each vertex, which won't change with graph isomorphism and should fully determine the graph. For example numbers of closed paths of length k for given starting…
The fundamental representations of the special linear group ${\rm SL}_n$ over the complex numbers are the exterior powers of $\mathbb{C}^n$. We consider the invariant rings of sums of arbitrary many copies of these ${\rm SL}_n$-modules. The…
We provide an algorithm that takes as an input a given parametric family of homogeneous polynomials, which is invariant under the action of the general linear group, and an integer $d$. It outputs the ideal of that family intersected with…
It is conjectured that the Kashiwara-Vergne Lie algebra $\widehat{\mathfrak{krv}}_2$ is isomorphic to the direct sum of the Grothendieck-Teichm\"uller Lie algebra $\mathfrak{grt}_1$ and a one-dimensional Lie algebra. In this paper, we use…
Power-type graphs, such as the power graph, the directed power graph, the enhanced power graph and the difference graph, encode significant information about the internal structure of a finite group. Despite substantial investigation in…
We give a combinatorial polynomial-time algorithm to find a maximum weight independent set in perfect graphs of bounded degree that do not contain a prism or a hole of length four as an induced subgraph. An even pair in a graph is a pair of…
This is a substantially revised version. The Kontsevich integral of a knot is a graph-valued invariant which (when graded by the Vassiliev degree of graphs) is characterized by a universal property; namely it is a universal Vassiliev…
Chevalley's theorem states that for any simple finite dimensional Lie algebra G (1) the restriction homomorphism of the algebra of polynomials on G onto the Cartan subalgebra H induces an isomorphism between the algebra of G-invariant…
This paper surveys a comprehensive, although not exhaustive, sampling of graph polynomials with the goal of providing a brief overview of a variety of techniques defining a graph polynomial and then for decoding the combinatorial…