Related papers: A relaxed version of \v{S}olt\'{e}s's problem and …
The Wiener index of a graph, which is the sum of the distances between all pairs of vertices, has been well studied. Recently, Sills and Wang in 2012 proposed two conjectures on the maximal Wiener index of trees with a given degree…
The Wiener index of a graph is the sum of the distances between all pairs of vertices, it has been one of the main descriptors that correlate achemical compound's molecular graph with experimentally gathered data regarding the compound's…
The subpath number of a graph G is defined as the total number of subpaths in G, and it is closely related to the number of subtrees, a well-studied topic in graph theory. This paper is a continuation of our previous paper [5], where we…
The Wiener polarity index of a graph is defined as the number of unordered pairs of vertices at distance three. In recent years, this topological index was extensively studied since it has many known applications in chemistry and also in…
The edge Szeged index and edge-vertex Szeged index of a graph are defined as $Sz_{e}(G)=\sum\limits_{uv\in E(G)}m_{u}(uv|G)m_{v}(uv|G)$ and $Sz_{ev}(G)=\frac{1}{2} \sum\limits_{uv \in E(G)}[n_{u}(uv|G)m_{v}(uv|G)+n_{v}(uv|G)m_{u}(uv|G)],$…
{\small The Wiener index $W(G)$ of a graph $G$ is the sum of the distances between all pairs of vertices in the graph. The Szeged index $Sz(G)$ of a graph $G$ is defined as $Sz(G)=\sum_{e=uv \in E}n_u(e)n_v(e)$ where $n_u(e)$ and $n_v(e)$…
A cactus is a connected graph in which each edge is contained in at most one cycle. We generalize the concept of cactus graphs, i.e., a $k$-cactus is a connected graph in which each edge is contained in at most $k$ cycles where $k\ge 1$. It…
For a simple graph $G$, let $n$ and $m$ denote the number of vertices and edges in $G$, respectively. The Erd\H{o}s-Gallai theorem for paths states that in a simple $P_k$-free graph, $m \leq \frac{n(k-1)}{2}$, where $P_k$ denotes a path…
We initiate the algorithmic study of retracting a graph into a cycle in the graph, which seeks a mapping of the graph vertices to the cycle vertices, so as to minimize the maximum stretch of any edge, subject to the constraint that the…
We show that on cactus graphs the Szeged index is bounded above by twice the Wiener index. For the revised Szeged index the situation is reversed if the graph class is further restricted. Namely, if all blocks of a cactus graph are cycles,…
The Wiener index of a graph $G$, denoted $W(G)$, is the sum of the distances between all pairs of vertices in $G$. \'E. Czabarka, et al. conjectured that for an $n$-vertex, $n\geq 4$, simple quadrangulation graph $G$,…
Fullerenes are molecules in the form of cage-like polyhedra, consisting solely of carbon atoms. Fullerene graphs are mathematical models of fullerene molecules. The transmission of a vertex $v$ of a graph is the sum of distances from $v$ to…
In 1975, P. Erd\H{o}s proposed the problem of determining the maximum number $f(n)$ of edges in a graph on $n$ vertices in which any two cycles are of different lengths. Let $f^{\ast}(n)$ be the maximum number of edges in a simple graph on…
The Wiener index is defined as the sum of distances between all unordered pairs of vertices in a graph. It is one of the most recognized and well-researched topological indices, which is on the other hand still a very active area of…
We define various notions of energy of a set of vertices in a graph, which generalize two of the most widely studied graphical indices: the Wiener index and the Harary index. We provide a new proof of a result due to Douthett and Krantz,…
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…
The cycles are the only $2$-connected graphs in which any two nonadjacent vertices form a vertex cut. We generalize this fact by proving that for every integer $k\ge 3$ there exists a unique graph $G$ satisfying the following conditions:…
A new efficient algorithm is presented for finding all simple cycles that satisfy a length constraint in a directed graph. When the number of vertices is non-trivial, most cycle-finding problems are of practical interest for sparse graphs…
Cut vertices are often used as a measure of nodes' importance within a network. They are those nodes whose failure disconnects a graph. Let N(G) be the number of connected induced subgraphs of a graph $G$. In this work, we investigate the…
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…