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.

scholarly journals Wiener Index of Edge Thorny Graphs of Catacondensed Benzenoids

Mathematics ◽  
2020 ◽  
Vol 8 (4) ◽  
pp. 467
Author(s):  
Andrey A. Dobrynin ◽  
Ali Iranmanesh
Keyword(s):  
Polycyclic Aromatic Hydrocarbons ◽  
Aromatic Hydrocarbons ◽  
Topological Index ◽  
Perfect Matching ◽  
Molecular Graph ◽  
Wiener Index ◽  
Benzenoid Graph ◽  
Polycyclic Aromatic ◽  
Distance Properties ◽  
Sum Of Distances

The Wiener index is a topological index of a molecular graph, defined as the sum of distances between all pairs of its vertices. Benzenoid graphs include molecular graphs of polycyclic aromatic hydrocarbons. An edge thorny graph G is constructed from a catacondensed benzenoid graph H by attaching new graphs to edges of a perfect matching of H. A formula for the Wiener index of G is derived. The index of the resulting graph does not contain distance characteristics of elements of H and depends on the Wiener index of H and distance properties of the attached graphs.

scholarly journals F-Index of some graph operations

2016 ◽  
Vol 08 (02) ◽  
pp. 1650025 ◽  
Author(s):  
Nilanjan De ◽  
Sk. Md. Abu Nayeem ◽  
Anita Pal
Keyword(s):  
Electron Energy ◽  
Topological Index ◽  
Zagreb Index ◽  
Zagreb Indices ◽  
Molecular Graphs ◽  
Basic Properties ◽  
Graph Operations ◽  
Physico Chemical ◽  
Vertex Degrees

The F-index of a graph is defined as the sum of cubes of the vertex degrees of the graph. This was introduced in 1972, in the same paper where the first and second Zagreb indices were introduced to study the structure-dependency of total [Formula: see text]-electron energy. But this topological index was not further studied till then. Very recently, Furtula and Gutman [A forgotten topological index,J. Math. Chem. 53(4) (2015) 1184–1190.] reinvestigated the index and named it “forgotten topological index” or “F-index”. In that paper, they present some basic properties of this index and showed that this index can enhance the physico-chemical applicability of Zagreb index. Here, we study the behavior of this index under several graph operations and apply our results to find the F-index of different chemically interesting molecular graphs and nanostructures.

scholarly journals WIENER INDEX OF INTERVAL WEIGHTED GRAPHS

2021 ◽  
Vol 21 (1) ◽  
pp. 21-28
Author(s):  
SEMIHA BASDAS NURKAHLI ◽  
SERIFE BUYUKKOSE
Keyword(s):  
Topological Index ◽  
Undirected Graph ◽  
Weighted Graph ◽  
Wiener Index ◽  
Weighted Graphs ◽  
Molecular Graphs ◽  
Interval Matrices ◽  
Study Interval

The Wiener index is classic and well-known topological index for the characterization of molecular graphs. In this paper, we study interval weighted graphs such as graphs where the edge weights are interval or interval matrices. In this study firstly we define interval weighted graph. Later we define Wiener index of interval weighted graph. From this definition, we give algorithms for finding Wiener index of interval weighted directed and undirected graph.

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.

Characteristic study of irregularity measures of some nanotubes

2019 ◽  
Vol 97 (10) ◽  
pp. 1125-1132 ◽  
Author(s):  
Zahid Iqbal ◽  
Adnan Aslam ◽  
Muhammad Ishaq ◽  
Muhammad Aamir
Keyword(s):  
Quantitative Structure ◽  
Structure Property ◽  
Know How ◽  
Molecular Graphs ◽  
Irregularity Index ◽  
Structure Property Relationships ◽  
Boiling Points ◽  
Quantitative Structure Property Relationships ◽  
Quantitative Structure Activity Relationships ◽  
Vertex Degrees

In many applications and problems in material engineering and chemistry, it is valuable to know how irregular a given molecular structure is. Furthermore, measures of the irregularity of underlying molecular graphs could be helpful for quantitative structure property relationships and quantitative structure-activity relationships studies, and for determining and expressing chemical and physical properties, such as toxicity, resistance, and melting and boiling points. Here we explore the following three irregularity measures: the irregularity index by Albertson, the total irregularity, and the variance of vertex degrees. Using graph structural analysis and derivation, we compute the above-mentioned irregularity measures of several molecular graphs of nanotubes.

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 Reformulated Zagreb Indices of Some Derived Graphs

Mathematics ◽  
2019 ◽  
Vol 7 (4) ◽  
pp. 366 ◽  
Author(s):  
Jia-Bao Liu ◽  
Bahadur Ali ◽  
Muhammad Aslam Malik ◽  
Hafiz Muhammad Afzal Siddiqui ◽  
Muhammad Imran
Keyword(s):  
Physical Properties ◽  
Chemical Structure ◽  
Topological Index ◽  
Chemical Reactivity ◽  
Line Graph ◽  
Total Graph ◽  
Zagreb Indices ◽  
Subdivision Graph ◽  
Chemical Constitution ◽  
Vertex Degrees

A topological index is a numeric quantity that is closely related to the chemical constitution to establish the correlation of its chemical structure with chemical reactivity or physical properties. Miličević reformulated the original Zagreb indices in 2004, replacing vertex degrees by edge degrees. In this paper, we established the expressions for the reformulated Zagreb indices of some derived graphs such as a complement, line graph, subdivision graph, edge-semitotal graph, vertex-semitotal graph, total graph, and paraline graph of a graph.

Sign in / Sign up

Export Citation Format

Share Document