Related papers: A note on 'A New Approach To Compute Wiener Index'
Let $R$ be a ring with unity. The cozero-divisor graph of a ring $R$, denoted by $\Gamma'(R)$, is an undirected simple graph whose vertices are the set of all non-zero and non-unit elements of $R$, and two distinct vertices $x$ and $y$ are…
Hyper-Wiener index was introduced as one of the main generalizations of the well known Wiener index. Through the years properties of the Wiener index have been extensively studied in both Mathematics and Chemistry. The Hyper-Wiener index,…
The Wiener index of a strong digraph $D$ is defined as the sum of the distances between all ordered pairs of vertices. This definition has been extended to digraphs that are not necessarily strong by defining the distance from a vertex $a$…
Let $G$ be a a connected graph. The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. We provide asymptotic formulae for the maximum Wiener index of simple triangulations and…
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…
Topological indices are parameters associated with graphs that have many applications in different areas such as mathematical chemistry. Among various topological indices, the Wiener index is classical \cite{w}. In this paper, we prove a…
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 Wiener index of a graph $W(G)$ is a well studied topological index for graphs. An outstanding problem of \v{S}olt{\'e}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…
Let $Sz(G),Sz^*(G)$ and $W(G)$ be the Szeged index, revised Szeged index and Wiener index of a graph $G.$ In this paper, the graphs with the fourth, fifth, sixth and seventh largest Wiener indices among all unicyclic graphs of order…
The Hosoya polynomial of a graph encompasses many of its metric properties, for instance the Wiener index (alias average distance) and the hyper-Wiener index. An expression is obtained that reduces the computation of the Hosoya polynomials…
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 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 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 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…
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$.…
Measuring similarity between complex objects is a fundamental task in many scientific fields. When objects are represented as graphs, graph similarity/distance measures offer a powerful framework for quantifying structural resemblance.…
The Wiener index of a graph is the sum of all the distances between any pair of vertices. We aim to describe graphs which minimize the Wiener index among all unicyclic graphs with fixed girth and given degree sequence. Depending on where…
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…
The Wiener index of a vertex coloring of a graph is defined to be the sum of all pairwise geodesic distances between vertices of the same color. We provide characterizations of vertex colorings of paths and cycles whose Wiener index is as…
Let $G$ be a connected graph of order $n$.The Wiener index $W(G)$ of $G$ is the sum of the distances between all unordered pairs of vertices of $G$. In this paper we show that the well-known upper bound $\big( \frac{n}{\delta+1}+2\big) {n…