scholarly journals On the Wiener Indices of Trees Ordering by Diameter-Growing Transformation Relative to the Pendent Edges

2019 ◽  
Vol 2019 ◽  
pp. 1-11 ◽  
Author(s):  
Xiaoxin Xu ◽  
Yubin Gao ◽  
Yanbin Sang ◽  
Yueliang Liang
Keyword(s):  
Graph Transformation ◽  
Wiener Index ◽  
Sum Of Distances

The Wiener index of a graph is defined as the sum of distances between all unordered pairs of its vertices. We found that finite steps of diameter-growing transformation relative to vertices can not always enable the Wiener index of a tree to increase sharply. In this paper, we provide a graph transformation named diameter-growing transformation relative to pendent edges, which increases Wiener index W(T) of a tree sharply after finite steps. Then, twenty-two trees are ordered by their Wiener indices, and these trees are proved to be the first twenty-two trees with the first up to sixteenth smallest Wiener indices.

scholarly journals Joins, coronas and their vertex-edge Wiener polynomials

2016 ◽  
Vol 47 (2) ◽  
pp. 163-178
Author(s):  
Mahdieh Azari ◽  
Ali Iranmanesh
Keyword(s):  
Generating Function ◽  
Connected Graph ◽  
Wiener Index ◽  
First Derivative ◽  
Sum Of Distances ◽  
Simple Connected Graph ◽  
Product Of Graphs ◽  
Corona Product

The vertex-edge Wiener index of a simple connected graph $G$ is defined as the sum of distances between vertices and edges of $G$. The vertex-edge Wiener polynomial of $G$ is a generating function whose first derivative is a $q-$analog of the vertex-edge Wiener index. Two possible distances $D_1(u, e|G)$ and $D_2(u, e|G)$ between a vertex $u$ and an edge $e$ of $G$ can be considered and corresponding to them, the first and second vertex-edge Wiener indices of $G$, and the first and second vertex-edge Wiener polynomials of $G$ are introduced. In this paper, we study the behavior of these indices and polynomials under the join and corona product of graphs. Results are applied for some classes of graphs such as suspensions, bottlenecks, and thorny graphs.

The second-minimum Wiener index of cacti with given cycles

2020 ◽  
pp. 2150039
Author(s):  
Hanyuan Deng ◽  
G. C. Keerthi Vasan ◽  
S. Balachandran
Keyword(s):  
Connected Graph ◽  
Wiener Index ◽  
Index Formula ◽  
Extremal Graphs ◽  
Unique Graph ◽  
Sum Of Distances ◽  
Appl Math

The Wiener index [Formula: see text] of a connected graph [Formula: see text] is the sum of distances between all pairs of vertices of [Formula: see text]. A connected graph [Formula: see text] is said to be a cactus if each of its blocks is either a cycle or an edge. Let [Formula: see text] be the set of all [Formula: see text]-vertex cacti containing exactly [Formula: see text] cycles. Liu and Lu (2007) determined the unique graph in [Formula: see text] with the minimum Wiener index. Gutman, Li and Wei (2017) determined the unique graph in [Formula: see text] with maximum Wiener index. In this paper, we present the second-minimum Wiener index of graphs in [Formula: see text] and identify the corresponding extremal graphs, which solve partially the problem proposed by Gutman et al. [Cacti with [Formula: see text]-vertices and [Formula: see text] cycles having extremal Wiener index, Discrete Appl. Math. 232 (2017) 189–200] in 2017.

scholarly journals Exact Formula for Computing the Hyper-Wiener Index on Rows of Unit Cells of the Face-Centred Cubic Lattice

2018 ◽  
Vol 26 (1) ◽  
pp. 169-187 ◽  
Author(s):  
Hamzeh Mujahed ◽  
Benedek Nagy
Keyword(s):  
Wiener Index ◽  
Exact Formula ◽  
Mathematical Induction ◽  
Binomial Coefficients ◽  
Integer Sequences ◽  
Cubic Lattice ◽  
Unit Cells ◽  
The Face ◽  
The Given ◽  
Sum Of Distances

Abstract Similarly to Wiener index, hyper-Wiener index of a connected graph is a widely applied topological index measuring the compactness of the structure described by the given graph. Hyper-Wiener index is the sum of the distances plus the squares of distances between all unordered pairs of vertices of a graph. These indices are used for predicting physicochemical properties of organic compounds. In this paper, the graphs of lines of unit cells of the face-centred cubic lattice are investigated. The graphs of face-centred cubic lattice contain cube points and face centres. Using mathematical induction, closed formulae are obtained to calculate the sum of distances between pairs of cube points, between face centres and between cube points and face centres. The sum of these formulae gives the hyper-Wiener index of graphs representing face-centred cubic grid with unit cells connected in a row. In connection to integer sequences, a recurrence relation is presented based on binomial coefficients.

scholarly journals On the Wiener Complexity and the Wiener Index of Fullerene Graphs

Mathematics ◽  
2019 ◽  
Vol 7 (11) ◽  
pp. 1071 ◽  
Author(s):  
Andrey A. Dobrynin ◽  
Andrei Yu Vesnin
Keyword(s):  
Mathematical Models ◽  
Wiener Index ◽  
The Other ◽  
Graph Invariant ◽  
Calculation Results ◽  
Local Graph ◽  
Sum Of Distances ◽  
Fullerene Graphs

Fullerenes are molecules that can be presented in the form of cage-like polyhedra, consisting only of carbon atoms. Fullerene graphs are mathematical models of fullerene molecules. The transmission of a vertex v of a graph is a local graph invariant defined as 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 ≤ 232 and IPR fullerene graphs of order n ≤ 270 are presented. The structure of graphs with the maximal Wiener complexity or the maximal Wiener index is discussed, and formulas for the Wiener index of several families of graphs are obtained.

On the Largest Distance (Signless Laplacian) Eigenvalue of Non-transmission-regular Graphs

2018 ◽  
Vol 34 ◽  
pp. 459-471 ◽  
Author(s):  
Shuting Liu ◽  
Jinlong Shu ◽  
Jie Xue
Keyword(s):  
Spectral Radius ◽  
Regular Graph ◽  
Connected Graph ◽  
Distance Matrix ◽  
Laplacian Matrix ◽  
Wiener Index ◽  
Regular Graphs ◽  
Laplacian Eigenvalue ◽  
Signless Laplacian ◽  
Sum Of Distances

Let $G=(V(G),E(G))$ be a $k$-connected graph with $n$ vertices and $m$ edges. Let $D(G)$ be the distance matrix of $G$. Suppose $\lambda_1(D)\geq \cdots \geq \lambda_n(D)$ are the $D$-eigenvalues of $G$. The transmission of $v_i \in V(G)$, denoted by $Tr_G(v_i)$ is defined to be the sum of distances from $v_i$ to all other vertices of $G$, i.e., the row sum $D_{i}(G)$ of $D(G)$ indexed by vertex $v_i$ and suppose that $D_1(G)\geq \cdots \geq D_n(G)$. The $Wiener~ index$ of $G$ denoted by $W(G)$ is given by $W(G)=\frac{1}{2}\sum_{i=1}^{n}D_i(G)$. Let $Tr(G)$ be the $n\times n$ diagonal matrix with its $(i,i)$-entry equal to $TrG(v_i)$. The distance signless Laplacian matrix of $G$ is defined as $D^Q(G)=Tr(G)+D(G)$ and its spectral radius is denoted by $\rho_1(D^Q(G))$ or $\rho_1$. A connected graph $G$ is said to be $t$-transmission-regular if $Tr_G(v_i) =t$ for every vertex $v_i\in V(G)$, otherwise, non-transmission-regular. In this paper, we respectively estimate $D_1(G)-\lambda_1(G)$ and $2D_1(G)-\rho_1(G)$ for a $k$-connected non-transmission-regular graph in different ways and compare these obtained results. And we conjecture that $D_1(G)-\lambda_1(G)>\frac{1}{n+1}$. Moreover, we show that the conjecture is valid for trees.

On Wiener and terminal Wiener index of graphs

2015 ◽  
Vol 08 (05) ◽  
pp. 1550066 ◽  
Author(s):  
J. Baskar Babujee ◽  
J. Senbagamalar
Keyword(s):  
Topological Index ◽  
Wiener Index ◽  
Molecular Graphs ◽  
Structural Descriptor ◽  
Vertex Degrees ◽  
Pendent Vertices ◽  
Sum Of Distances

The Wiener index is a topological index defined as the sum of distances between all pairs of vertices in a graph. It was introduced as a structural descriptor for molecular graphs of alkanes, which are trees with vertex degrees of four at the most. The terminal Wiener index is defined as the sum of distances between all pairs of pendent vertices in a graph. In this paper we investigate Wiener and terminal Wiener for graphs derived from certain operations.

Wiener index on rows of unit cells of the face-centred cubic lattice

2016 ◽  
Vol 72 (2) ◽  
pp. 243-249 ◽  
Author(s):  
Hamzeh Mujahed ◽  
Benedek Nagy
Keyword(s):  
Molecular Graph ◽  
Chemical Properties ◽  
Wiener Index ◽  
Crystal Lattices ◽  
Cubic Lattice ◽  
Wiener Number ◽  
Unit Cells ◽  
The Face ◽  
Physical And Chemical ◽  
Sum Of Distances

The Wiener index of a connected graph, known as the `sum of distances', is the first topological index used in chemistry to sum the distances between all unordered pairs of vertices of a graph. The Wiener index, sometimes called the Wiener number, is one of the indices associated with a molecular graph that correlates physical and chemical properties of the molecule, and has been studied for various kinds of graphs. In this paper, the graphs of lines of unit cells of the face-centred cubic lattice are investigated. This lattice is one of the simplest, the most symmetric and the most usual, cubic crystal lattices. Its graphs contain face centres of the unit cells and other vertices, called cube vertices. Closed formulae are obtained to calculate the sum of shortest distances between pairs of cube vertices, between cube vertices and face centres and between pairs of face centres. Based on these formulae, their sum, the Wiener index of a face-centred cubic lattice with unit cells connected in a row graph, is computed.

scholarly journals On the Wiener Index of the Dot Product Graph over Monogenic Semigroups

2020 ◽  
Vol 13 (5) ◽  
pp. 1231-1240
Author(s):  
Büşra Aydın ◽  
Nihat Akgüneş ◽  
İsmail Naci Cangül
Keyword(s):  
Graph Theory ◽  
Connected Graph ◽  
Molecular Graph ◽  
Wiener Index ◽  
Spectral Graph Theory ◽  
Topological Graph ◽  
Product Graph ◽  
Spectral Graph ◽  
Dot Product ◽  
Sum Of Distances

Algebraic study of graphs is a relatively recent subject which arose in two main streams: One is named as the spectral graph theory and the second one deals with graphs over several algebraic structures. Topological graph indices are widely-used tools in especially molecular graph theory and mathematical chemistry due to their time and money saving applications. The Wiener index is one of these indices which is equal to the sum of distances between all pairs of vertices in a connected graph. The graph over the nite dot product of monogenic semigroups has recently been dened and in this paper, some results on the Wiener index of the dot product graph over monogenic semigroups are given.

scholarly journals Terminal Wiener Index of Fibonacci trees

2020 ◽  
Vol 9 (3) ◽  
pp. 2533-2535
Keyword(s):  
Closed Form ◽  
Linear Time ◽  
Wiener Index ◽  
Time Algorithm ◽  
Closed Form Expression ◽  
Linear Time Algorithm ◽  
Form Expression ◽  
Sum Of Distances

The terminal Wiener index of a tree is defined as the sum of distances between all leaf pairs of T. We derive closed form expression for the terminal Wiener index of fibonacci trees. We also describe a linear time algorithm to compute terminal Wiener index of a tree.

Wiener Index of k-Connected Graphs

2021 ◽  
pp. 2142005
Author(s):  
Xiang Qin ◽  
Yanhua Zhao ◽  
Baoyindureng Wu
Keyword(s):  
Positive Integer ◽  
Connected Graph ◽  
Wiener Index ◽  
Index Formula ◽  
Connected Graphs ◽  
Sum Of Distances

The Wiener index [Formula: see text] of a connected graph [Formula: see text] is the sum of distances of all pairs of vertices in [Formula: see text]. In this paper, we show that for any even positive integer [Formula: see text], and [Formula: see text], if [Formula: see text] is a [Formula: see text]-connected graph of order [Formula: see text], then [Formula: see text], where [Formula: see text] is the [Formula: see text]th power of a graph [Formula: see text]. This partially answers an old problem of Gutman and Zhang.

Sign in / Sign up

Export Citation Format

Share Document