Related papers: Computing the Wiener index in Sierpinski carpet gr…
We prove that the number of iterations taken by the Weisfeiler-Leman algorithm for configurations coming from Schreier graphs is closely linked to the diameter of the graphs themselves: an upper bound is found for general Schreier graphs,…
In this paper, we discuss the Hamiltonicity of graphs in terms of Wiener index, hyper-Wiener index and Harary index of their quasi-complement or complement. Firstly, we give some sufficient conditions for an balanced bipartite graph with…
We show that there exist linear-time algorithms that compute the strong chromatic index of Halin graphs, of maximal outerplanar graphs and of distance-hereditary graphs.
The problem of recovering graph signals is one of the main topics in graph signal processing. A representative approach to this problem is the graph Wiener filter, which utilizes the statistical information of the target signal computed…
We compute the index of the real Cauchy-Riemann operator defined in FJRW theory in case of the smooth metric. For the cylindrical metric, we study the relation between the index of the linearized operator of Witten map and weights in…
The transmission of a vertex $v$ of a graph $G$ is the sum of distances from $v$ to all the other vertices in $G$. The Wiener complexity of $G$ is the number of different transmissions of its vertices. Similarly, the eccentric complexity of…
The Wiener index of a connected graph is defined as the sum of distances between all its unordered pairs of vertices. Characterising graphs on $n$ vertices with a fixed diameter that maximise the Wiener index is a long-standing open…
The wreath product of graphs is a graph composition inspired by the notion of wreath product of groups, with interesting connections with Geometric Group Theory and Probability. This paper is devoted to the description of some degree and…
The Graovac-Pisanski index, which is also called the modified Wiener index, was introduced in 1991 by A. Graovac and T. Pisanski. This variation of the classical Wiener index takes into account the symmetries of a graph. In 2016 M. Ghorbani…
We present a method based on simulated annealing to obtain a nested split graph that approximates a real complex graph. This is used to compute a number of graph indices using very efficient algorithms that we develop, leveraging the…
We propose an algorithm for solving of the graph isomorphism problem. Also, we introduce the new class of graphs for which the graph isomorphism problem can be solved polynomially using the algorithm.
In this article, we provide an introduction to an algorithm for constructing Weinstein handlebodies for complements of certain smoothed toric divisors using explicit coordinates and a simple example. This article also serves to welcome…
The Steiner $k$-eccentricity of a vertex $v$ of a graph $G$ is the maximum Steiner distance over all $k$-subsets of $V (G)$ which contain $v$. A linear time algorithm for calculating the Steiner $k$-eccentricity of a vertex on block graphs…
We present algorithms to work with iterated Eisenstein integrals that have recently appeared in the computation of multi-loop Feynman integrals. These algorithms allow one to analytically continue these integrals to all regions of the…
We give an algorithm for finding the index of a positive outer automorphism of the free group, and prove the algorithm exits in a finite time.
In this article, we derive Stein's method for approximating a spatial random graph by a generalised random geometric graph, which has vertices given by a finite Gibbs point process and edges based on a general connection function. Our main…
The weighted Szeged index and the weighted vertex-PI index of a connected graph $G$ are defined as $wSz(G) = \sum_{e=uv \in E(G)} (deg (u) + deg (v))n_u(e)n_v(e)$ and $wPI_v(G) = \sum_{e=uv \in E(G)} (deg(u) + deg(v))( n_u(e) + n_v(e))$,…
We state and prove some counting formulas relating to cliques in the distant graphs of projective lines over finite rings. As a preliminary to this, we prove a decomposition theorem for the graphs in terms of the direct-product…
We compute the Witten index of one-dimensional gauged linear sigma models with at least ${\mathcal N}=2$ supersymmetry. In the phase where the gauge group is broken to a finite group, the index is expressed as a certain residue integral. It…
We investigate a special case of the maximum quadratic assignment problem where one matrix is a product matrix and the other matrix is the distance matrix of a one-dimensional point set. We show that this special case, which we call the…