The Wiener index $W(G)$ of a connected graph $G$ is a sum of distances between all pairs of vertices of $G$. In 1991, Šoltés formulated the problem of finding all graphs $G$ such that for every vertex $v$ the equation $W(G)=W(G-v)$ holds. The cycle $C_{11}$ is the only known graph with this property. In this paper we consider the following relaxation of the original problem: find a graph with a large proportion of vertices such that removing any one of them does not change the Wiener index of a graph. As the main result, we build an infinite series of graphs with the proportion of such vertices tending to $\frac{1}{2}$.
The Wiener index of a connected graph is defined as the sum of the distances between all unordered pair of its vertices. In this paper, we characterize the graphs which extremize the Wiener index among all graphs on $n$ vertices with $k$ pendant vertices. We also characterize the graph which minimizes the Wiener index over the graphs on $n$ vertices with $s$ cut vertices.
The Wiener index of a connected graph is the sum of the distance of all pairs of distinct vertices. It was introduced by Wiener in 1947 to analyze some aspects of branching by fitting experimental data for several properties of alkane compounds. Denote by $\mathcal{U}_{n,r}$ the set of unicyclic graphs with $n$ vertices and $r$ vertices of even degree. In this paper we present a structural result on the graphs in $\mathcal{U}_{n,r}$ with minimum Wiener index and completely characterize such graphs when $ r\leq \frac{n+3}{2}$.
The edge-Wiener index $W_e(G)$ of a connected graph $G$ is the sum of distances between all pairs of edges of $G$. A connected graph $G$ is said to be a cactus if each of its blocks is either a cycle or an edge. Let $\mathcal{G}_{n,t}$ denote the class of all cacti with $n$ vertices and $t$ cycles. In this paper, the upper bound and lower bound on the edge-Wiener index of graphs in $\mathcal{G}_{n,t}$ are identified and the corresponding extremal graphs are characterized.
Let $S$ be a set of vertices of a connected graph $G$. The Steiner distance of $S$ is the minimum size of a connected subgraph of $G$ containing all the vertices of $S$. The Steiner $k$-Wiener index is the sum of all Steiner distances on sets of $k$ vertices of $G$. Different simple methods for calculating the Steiner $k$-Wiener index of block graphs are presented.
Let $S$ be a set of vertices of a connected graph $G$. The Steiner distance of $S$ is the minimum size of a connected subgraph of $G$ containing all the vertices of $S$. The sum of all Steiner distances on sets of size $k$ is called the Steiner $k$-Wiener index, hence for $k=2$ we get the Wiener index. The modular graphs are graphs in which every three vertices $x, y$ and $z$ have at least one median vertex $m(x,y,z)$ that belongs to shortest paths between each pair of $x, y$ and $z$. The Steiner 3-Wiener index of a modular graph is expressed in terms of its Wiener index. As a corollary formul…
The Wiener index $W(G)$ is the sum of distances of all pairs of vertices of the graph $G$. The Wiener polarity index $W_{p}(G)$ of a graph $G$ is the number of unordered pairs of vertices $u$ and $v$ of $G$ such that the distance $d_{G}(u,v)$ between $u$ and $v$ is $3$. In this paper the Wiener and the Wiener polarity indices of sun graphs are computed. A relationship between those indices with some other topological indices are presented. Finally, we find the Hosoya (Wiener) polynomial for sun graphs.
Fullerene graphs are mathematical models of fullerene molecules. The Wiener $(r,s)$-complexity of a fullerene graph $G$ with vertex set $V(G)$ is the number of pairwise distinct values of $(r,s)$-transmission $tr_{r,s}(v)$ of its vertices $v$: $tr_{r,s}(v)= \sum_{u \in V(G)} \sum_{i=r}^{s} d(v,u)^i$ for positive integer $r$ and $s$. The Wiener $(1,1)$-complexity is known as the Wiener complexity of a graph. Irregular graphs have maximum complexity equal to the number of vertices. No irregular fullerene graphs are known for the Wiener complexity. Fullerene (IPR fullerene) graphs with n vertices…
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 characteristics. The tree that minimizes the Wiener index among trees of given maximal degree was studied. We characterize trees that achieve the maximum and minimum Wiener index, given the number of vertices and the degree sequence.
{\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)$ are, respectively, the number of vertices of $G$ lying closer to vertex $u$ than to vertex $v$ and the number of vertices of $G$ lying closer to vertex $v$ than to vertex $u$. Hansen used the computer programm AutoGraphiX and made the following conjecture about the Szeged index and the Wiener index for a bipartite connected graph $G$ with $n \geq 4$ vertices …
For a connected graph $G$, the Wiener index, denoted by $W(G)$, is the sum of the distance of all pairs of distinct vertices and the eccentricity, denoted by $\varepsilon(G)$, is the sum of the eccentricity of individual vertices. In \cite{Kc}, the authors posed a conjecture which states that given a graph $G$ with at least three vertices, the difference between $W(G)$ and $\varepsilon(G)$ decreases when an edge is contracted and proved that the conjecture is true when $e$ is a bridge. In this manuscript, we confirm that the conjecture is true for any connected graph $G$ with at least three ve…
The Wiener index of a connected graph is the sum of distances between all unordered pairs of vertices. Sam Spiro [The Wiener index of signed graphs, Appl. Math. Comput., 416(2022)126755] recently introduced the Wiener index for a signed graph and conjectured that the path $P_n$ with alternating signs has the minimum Wiener index among all signed trees with $n$ vertices. By constructing an infinite family of counterexamples, we prove that the conjecture is false whenever $n$ is at least 30.
The Wiener index is maximized over the set of trees with the given vertex weight and degree sequences. This model covers the traditional "unweighed" Wiener index, the terminal Wiener index, and the vertex distance index. It is shown that there exists an optimal caterpillar. If weights of internal vertices increase in their degrees, then an optimal caterpillar exists with weights of internal vertices on its backbone monotonously increasing from some central point to the ends of the backbone, and the same is true for pendent vertices. A tight upper bound of the Wiener index value is proposed and…
Hansen et. al. used the computer programm AutoGraphiX to study the differences between the Szeged index $Sz(G)$ and the Wiener index $W(G)$, and between the revised Szeged index $Sz^*(G)$ and the Wiener index for a connected graph $G$. They conjectured that for a connected nonbipartite graph $G$ with $n \geq 5$ vertices and girth $g \geq 5,$ $ Sz(G)-W(G) \geq 2n-5. $ Moreover, the bound is best possible as shown by the graph composed of a cycle on 5 vertices, $C_5$, and a tree $T$ on $n-4$ vertices sharing a single vertex. They also conjectured that for a connected nonbipartite graph $G$ with …
The reverse Wiener index of a connected graph $G$ is a variation of the well-known Wiener index $W(G)$ defined as the sum of distances between all unordered pairs of vertices of $G$. It is defined as $Λ(G)=\frac{1}{2}n(n-1)d-W(G)$, where $n$ is the number of vertices, and $d$ is the diameter of $G$. We now determine the second and the third smallest reverse Wiener indices of $n$-vertex trees and characterize the trees whose reverse Wiener indices attain these values for $n\ge 6$ (it has been known that the star is the unique tree with the smallest reverse Wiener index).
In theoretical chemistry, distance-based molecular structure descriptors are used for modeling physical, pharmacologic, biological and other properties of chemical compounds. We introduce a generalized Wiener polarity index $W_k (G)$ as the number of unordered pairs of vertices ${u, v}$ of $G$ such that the shortest distance $d (u, v)$ between $u$ and $v$ is $k$ (this is actually the $k$-th coefficient in the Wiener polynomial). For $k = 3$, we get standard Wiener polarity index. Furthermore, we generalize the terminal Wiener index $TW_k (G)$ as the sum of distances between all pairs of vertic…
The Wiener polarity index $W_p$, one of the most studied molecular structure descriptors, was devised by the chemist Harold Wiener for predicting the boiling points of alkanes. The index $W_p$ for chemical trees (chemical graphs representing alkanes) is defined as the number of unordered pairs of vertices at distance 3. A vertex of a chemical tree with the degree at least 3 is called a branching vertex. A segment of a chemical tree $T$ is a path-subtree $S$ whose terminal vertices have degrees different from 2 in $T$ and every internal vertex (if exists) of $S$ has degree 2 in $T$. In this pap…
The Steiner distance of vertices in a set $S$ is the minimum size of a connected subgraph that contain these vertices. The sum of the Steiner distances over all sets $S$ of cardinality $k$ is called the Steiner $k$-Wiener index and studied as the natural generalization of the famous Wiener index in chemical graph theory. In this paper we study the extremal structures, among trees with a given segment sequence, that maximize or minimize the Steiner $k$-Wiener index. The same extremal problems are also considered for trees with a given number of segments.
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 $G$ is defined as the number of different eccentricities of its vertices. In this paper these two complexities are compared. The complexities are first studied on Cartesian product graphs. Transmission indivisible graphs and arithmetic transmission graphs are introduced to demonstrate sharpness of upper and lower bounds on the Wiener complexity, respectivel…
The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. A connected graph is Eulerian if its vertex degrees are all even. In [Gutman, Cruz, Rada, Wiener index of Eulerian Graphs, Discrete Applied Mathematics 132 (2014), 247-250] the authors proved that the cycle is the unique graph maximising the Wiener index among all Eulerian graphs of given order. They also conjectured that for Eulerian graphs of order $n \geq 26$ the graph consisting of a cycle on $n-2$ vertices and a triangle that share a vertex is the unique Eulerian graph with second la…
The Wiener index of a (hyper)graph is calculated by summing up the distances between all pairs of vertices. We determine the maximum possible Wiener index of a connected $n$-vertex $k$-uniform hypergraph and characterize for every~$n$ all hypergraphs attaining the maximum Wiener index.
In this article, we determine the maximum Wiener indices of unicyclic graphs with given number of vertices and matching number. We also characterize the extremal graphs. This solves an open problem of Du and Zhou.
We prove that the Wiener Index $W(G)$ of a Maximal Planar graph $G$ with $n$ vertices satisfies $W(G) \leq \Big{\lfloor} \frac{1}{18}(n^3 + 3n^2) \Big{\rfloor}$ for $3 \leq n \leq 18$.
The Wiener index (the distance) of a connected graph is the sum of distances between all pairs of vertices. In this paper, we study the maximum possible value of this invariant among graphs on $n$ vertices with fixed number of blocks $p$. It is known that among graphs on $n$ vertices that have just one block, the $n$-cycle has the largest Wiener index. And the $n$-path, which has $n-1$ blocks, has the maximum Wiener index in the class of graphs on $n$ vertices. We show that among all graphs on $n$ vertices which have $p\ge 2$ blocks, the maximum Wiener index is attained by a graph composed of …
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, the equality is obtained if and only if $G$ is the complete graph $K_{n-1}$ with an extra vertex attached to either $2$ or $n-2$ vertices of $K_{n-1}$. We apply our method to strengthen some known results on the difference between the Szeged and Wiener index of bipartite graphs, graphs of girth at least five, and the difference between the revised Szeged and W…
The Wiener index W(G) of a simple connected graph G is defined as the sum of distances over all pairs of vertices in a graph. We denote by W[T_{n}] the set of all values of Wiener index for a graph from class T_{n} of trees on n vertices. The largest interval of contiguous integers (contiguous even integers in case of odd n) is denoted by W^{int}[T_{n}]. In this paper we prove that both sets are of the cardinality (1/6)n^3+O(n^2) in the case of even n, while in the case of odd n we prove that the cardinality of both sets equals (1/(12))n^3+O(n^2) solving thus two conjectures posed in literatur…
The Wiener index of a connected graph is the sum of topological distances between all pairs of vertices. Since Wang gave a mistake result on the maximum Wiener index for given tree degree sequence, in this paper, we investigate the maximum Wiener index of trees with given degree sequences and extremal trees which attain the maximum value.
We exhibit a close connection between hitting times of the simple random walk on a graph, the Wiener index, and related graph invariants. In the case of trees we obtain a simple identity relating hitting times to the Wiener index. It is well known that the vertices of any graph can be put in a linear preorder so that vertices appearing earlier in the preorder are "easier to reach" by a random walk, but "more difficult to get out of". We define various other natural preorders and study their relationships. These preorders coincide when the graph is a tree, but not necessarily otherwise. Our tre…
The Wiener polarity index of a graph G is the number of unordered pairs of vertices u, v such that the distance between u and v is 3. In this paper we give an explicit formula for the Wiener polarity index of cactus graphs. We also deduce formulas for some special cactus graphs.
The eccentric sequence of a connected graph $G$ is the nondecreasing sequence of the eccentricities of its vertices. The Wiener index of $G$ is the sum of the distances between all unordered pairs of vertices of $G$. The unique trees that minimise the Wiener index among all trees with a given eccentric sequence were recently determined by the present authors. In this paper we show that these results hold not only for the Wiener index, but for a large class of distance-based topological indices which we term Wiener-type indices. Particular cases of this class include the hyper-Wiener index, the…
The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. We provide formulae for the minimum Wiener index of simple triangulations and quadrangulations with connectivity at least $c$, and provide the extremal structures, which attain those values. Our main tool is setting upper bounds for the maximum degree in highly connected triangulations and quadrangulations.
Wiener index, defined as the sum of distances between all unordered pairs of vertices, is one of the most popular molecular descriptors. It is well known that among 2-vertex connected graphs on $n\ge 3$ vertices, the cycle $C_n$ attains the maximum value of Wiener index. We show that the second maximum graph is obtained from $C_n$ by introducing a new edge that connects two vertices at distance two on the cycle if $n\ne 6$. If $n\ge 11$, the third maximum graph is obtained from a $4$-cycle by connecting opposite vertices by a path of length $n-3$. We completely describe also the situation for …
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 sequence. This note proves one of the two conjectures and disproves the other.
The Wiener index of a graph $W(G)$ is a well studied topological index for graphs. An outstanding problem of Šolt{é}s is to find graphs $G$ such that $W(G)=W(G-v)$ for all vertices $v\in V(G)$, with the only known example being $G=C_{11}$. We relax this problem by defining a notion of Wiener indices for signed graphs, which we denote by $W_σ(G)$, and under this relaxation we construct many signed graphs such that $W_σ(G)=W_σ(G-v)$ for all $v\in V(G)$. This ends up being related to a problem of independent interest, which asks when it is possible to $2$-color the edges of a graph $G$ such that …
The Wiener index (i.e., the total distance or the transmission number), defined as the sum of distances between all unordered pairs of vertices in a graph, is one of the most popular molecular descriptors. In this article we summarize some results, conjectures and problems on this molecular descriptor, with emphasis on works we were involved in.
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 all the other vertices. The number of different vertex transmissions is called the Wiener complexity of a graph. Some calculation results on the Wiener complexity and the Wiener index of fullerene graphs of order $n \le 216$ are presented. Structure of graphs with the maximal Wiener complexity or the maximal Wiener index is discussed and formulas for the Wi…
In 1997 Klavžar and Gutman suggested a generalization of the Wiener index to vertex-weighted graphs. We minimize the Wiener index over the set of trees with the given vertex weights' and degrees' sequences and show an optimal tree to be the, so-called, Huffman tree built in a bottom-up manner by sequentially connecting vertices of the least weights.
The Wiener index of a connected graph is the sum of the distances between all pairs of vertices in the graph. It was conjectured that the Wiener index of an $n$-vertex maximal planar graph is at most $\lfloor\frac{1}{18}(n^3+3n^2)\rfloor$. We prove this conjecture and for every $n$, $n \geq 10$, determine the unique $n$-vertex maximal planar graph for which this maximum is attained.
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 research. This work presents a natural continuation of the paper Mathematical aspects of Wiener index (Ars Math. Contemp., 2016) in which several interesting open questions on the topic were outlined. Here we collect answers gathered so far, give further insights on the topic of extremal values of Wiener index in different settings, and present further intriguing p…
Let $G=(V(G),E(G))$ be a molecular graph, where $V(G)$ and $E(G)$ are the sets of vertices (atoms) and edges (bonds). A topological index of a molecular graph is a numerical quantity which helps to predict the chemical/physical properties of the molecules. The Wiener, Wiener polarity and the terminal Wiener indices are the distance based topological indices. In this paper, we described a linear time algorithm {\bf(LTA)} that computes the Wiener index for acyclic graphs and extended this algorithm for unicyclic graphs. The same algorithms are modified to compute the terminal Wiener index and th…
The terminal Wiener index of a tree is the sum of distances for all pairs of pendent vertices, which recently arises in the study of phylogenetic tree reconstruction and the neighborhood of trees. This paper presents a sharp upper and lower bounds for the terminal Wiener index in terms of its order and diameter and characterizes all extremal trees which attain these bounds. In addition, we investigate the properties of extremal trees which attain the maximum terminal Wiener index among all trees of order $n$ with fixed maximum degree.
Besides the well known Wiener index, which sums up the distances between all the pairs of vertices, and the hyper-Wiener index, which includes also the squares of distances, the edge versions of both indices attracted a lot of attention in the recent years. In this paper we consider the edge-Wiener index and the edge-hyper-Wiener index of phenylenes, which represent an important class of molecular graphs. For an arbitrary phenylene, four quotient trees based on the elementary cuts are defined in a similar way as it was previously done for benzenoid systems. The computation of the edge-Wiener i…
The Wiener index of a connected graph is the summation of all distances between unordered pairs of vertices of the graph. In this paper, we give an upper bound on the Wiener index of a $k$-connected graph $G$ of order $n$ for integers $n-1>k \ge 1$: \[W(G) \le \frac{1}{4} n \lfloor \frac{n+k-2}{k} \rfloor (2n+k-2-k\lfloor \frac{n+k-2}{k} \rfloor).\] Moreover, we show that this upper bound is sharp when $k \ge 2$ is even, and can be obtained by the Wiener index of Harary graph $H_{k,n}$.
Various questions related to distances between vertices of simple, finite graphs are of interest to extremal graph theorists. The Steiner distance of a set of $k$ vertices is a natural generalization of the regular distance. We extend several theorems on the middle parts and extremal values of trees from their regular distance variants to their Steiner distance variants. More specifically, we show that for a tree $T$, the Steiner $k$-distance, Steiner $k$-leaf-distance, and Steiner $k$-internal-distance are all concave along a path. We also calculate distances between the Steiner $k$-median, S…
The Wiener index of a graph $G$, denoted $W(G)$, is the sum of the distances between all pairs of vertices in $G$. É. Czabarka, et al. conjectured that for an $n$-vertex, $n\geq 4$, simple quadrangulation graph $G$, \begin{equation*}W(G)\leq \begin{cases} \frac{1}{12}n^3+\frac{7}{6}n-2, &\text{ $n\equiv 0~(mod \ 2)$,}\\ \frac{1}{12}n^3+\frac{11}{12}n-1, &\text{ $n\equiv 1~(mod \ 2)$}. \end{cases} \end{equation*} In this paper, we confirm this conjecture.
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, then its revised Szeged index is bounded below by twice its Wiener index. Additionally, we show that these bounds are sharp and examine the cases of equality. Along the way, we provide a formulation of the revised Szeged index as a sum over vertices, which proves very helpful, and may be interesting in other contexts.
The Wiener index W(G) of a connected graph $G$ is the sum of distances between all pairs of vertices in G$. In this paper, we first give the recurrences or explicit formulae for computing the Wiener indices of spiro and polyphenyl hexagonal chains, which are graphs of a class of unbranched multispiro molecules and polycyclic aromatic hydrocarbons, then we establish a relation between the Wiener indices of a spiro hexagonal chain and its corresponding polyphenyl hexagonal chain, and determine the extremal values and characterize the extremal graphs with respect to the Wiener index among all spi…
Let $G$ be a connected graph. The Steiner distance $d(S)$ of a set $S$ of vertices is the minimum size of a connected subgraph of $G$ containing all vertices of $S$. For $k\in \mathbb{N}$, the Steiner $k$-Wiener index $SW_k(G)$ is defined as $\sum_S d(S)$, where the sum is over all $k$-element subsets of the vertex set of $G$. The average Steiner $k$-distance $μ_k(G)$ of $G$ is defined as $\binom{n}{k}^{-1} SW_k(G)$. In this paper we prove upper bounds on the Steiner Wiener index and the average Steiner distance of graphs with given order $n$ and minimum degree $δ$. Specifically we show that $…
In this paper, we investigate the edge-Wiener index, the Szeged index, the edge-Szeged index, and the PI index, which are some of the most studied distance-based topological indices. As the main result we show that for benzenoid systems these indices can be computed in sub-linear time with respect to the number of vertices. More precisely, they can be computed in the time dependent on the length of the boundary cycle of a benzenoid system.
Daisy cubes are a class of isometric subgraphs of the hypercubes Q n. Daisy cubes include some previously well known families of graphs like Fibonacci cubes and Lucas cubes. Moreover they appear in chemical graph theory. Two distance invariants, Wiener and Mostar indices, have been introduced in the context of the mathematical chemistry. The Wiener index W (G) is the sum of distance between all unordered pairs of vertices of a graph G. The Mostar index Mo(G) is a measure of how far G is from being distance balanced. In this paper we establish that the Wiener and the Mostar indices of a daisy c…
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 maximum of N(G) where $G$ is a unicyclic graph with $n$ nodes of which $c$ are cut vertices. For all valid $n,c$, we give a full description of those maximal (that maximise N(.)) unicyclic graphs. It is found that there are generally two maximal unicyclic graphs. For infinitely many values of $n,c$, however, there is a unique maximal unicyclic graph with $n$ …
In this paper, we consider a molecular descriptor called the Wiener polarity index, which is defined as the number of unordered pairs of vertices at distance three in a graph. Molecular descriptors play a fundamental role in chemistry, materials engineering, and in drug design since they can be correlated with a large number of physico-chemical properties of molecules. As the main result, we develop a method for computing the Wiener polarity index for two basic and most commonly studied families of molecular graphs, benzenoid systems and carbon nanotubes. The obtained method is then used to fi…
