Related papers: General cut method for computing Szeged-like topol…

A method for compression of large graphs and matrices to a block structure is further developed. Szemer\'edi's regularity lemma is used as a generic motivation of the significance of stochastic block models. Another ingredient of the method…

In this paper, we prove a collection of results on graphical indices. We determine the extremal graphs attaining the maximal generalized Wiener index (e.g. the hyper-Wiener index) among all graphs with given matching number or independence…

We prove a conjecture of Nadjafi-Arani, Khodashenas and Ashrafi on the difference between the Szeged and Wiener index of a graph. Namely, if $G$ is a 2-connected non-complete graph on $n$ vertices, then $Sz(G)-W(G)\ge 2n-6$. Furthermore,…

In this paper, the investigates Adriatic indices, specifically the sum lordeg index where it defined as $SL(G) = \sum_{u \in V(G)} \deg_G(u) \sqrt{\ln \deg_G(u)}$ and the variable sum exdeg index $SEI_a(G)$ for $a>0$, $a\neq 1$. We present…

The general method of graph coarsening or graph reduction has been a remarkably useful and ubiquitous tool in scientific computing and it is now just starting to have a similar impact in machine learning. The goal of this paper is to take a…

We revisit the effectiveness of topological descriptors for molecular graph classification and design a simple, yet strong baseline. We demonstrate that a simple approach to feature engineering - employing histogram aggregation of edge…

We present an exact algorithm for computing all common subgraphs with the maximum number of vertices across multiple graphs. Our approach is further extended to handle the connected Maximum Common Subgraph (MCS), identifying the largest…

The forgotten topological index or F-index of a graph is defined as the sum of cubes of the degree of all the vertices of the graph. In this paper we study the F-index of four operations related to the lexicographic product on graphs which…

The revised Szeged index of a graph $G$ is defined as $Sz^*(G)=\sum_{e=uv \in E}(n_u(e)+ n_0(e)/2)(n_v(e)+ n_0(e)/2),$ where $n_u(e)$ and $n_v(e)$ are, respectively, the number of vertices of $G$ lying closer to vertex $u$ than to vertex…

Let $G = (V, E)$ be a graph. The first Zagreb index and the forgotten topological index of a graph $G$ are defined respectively as $\sum_{u \in V} d^2(u)$ and $\sum_{u \in V} d^3(u)$, where $d(u)$ is the degree of vertex $u$ in $G$. If the…

Inspired by work of Fr\"oberg (1990), and Eagon and Reiner (1998), we define the \emph{total $k$-cut complex} of a graph $G$ to be the simplicial complex whose facets are the complements of independent sets of size $k$ in $G$. We study the…

The aim of this paper is to obtain new inequalities for a large family of topological indices restricted to unicyclic graphs and to characterize the set of extremal unicyclic graphs with respect to them. This family includes variable first…

We propose a novel method for topological analysis of unweighted graphs which is based on \textit{persistent homology}. The proposed method maps the input graph to a complete weighted graph where the weighting function maps each edge to a…

We define the $k$-cut complex of a graph $G$ with vertex set $V(G)$ to be the simplicial complex whose facets are the complements of sets of size $k$ in $V(G)$ inducing disconnected subgraphs of $G$. This generalizes the Alexander dual of a…

Let ${\mathcal G}_n$ be the set of class of graphs of order $n$. The first Zagreb index $M_1(G)$ is equal to the sum of squares of the degrees of the vertices, and the second Zagreb index $M_2(G)$ is equal to the sum of the products of the…

We continue the study of the $k$-cut complex $\Delta_k(G)$ of a graph $G$ initiated in the paper of Bayer, Denker, Jeli\'c Milutinovi\'c, Rowlands, Sundaram and Xue [Topology of cut complexes of graphs, SIAM J. on Discrete Math. 38(2):…

In this paper we obtain bounds on a very general class of distance-based topological indices of graphs, which includes the Wiener index, defined as the sum of the distances between all pairs of vertices of the graph, and most…

Spatial graphs are particular graphs for which the nodes are localized in space (e.g., public transport network, molecules, branching biological structures). In this work, we consider the problem of spatial graph reduction, that aims to…

We present a new, systematic approach for analyzing network topologies. We first introduce the dK-series of probability distributions specifying all degree correlations within d-sized subgraphs of a given graph G. Increasing values of d…

The Wiener index is one of the oldest graph parameter which is used to study molecular-graph-based structure. This parameter was first proposed by Harold Wiener in 1947 to determining the boiling point of paraffin. The Wiener index of a…