Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Algorithms for Computing Wiener Indices of Acyclic and Unicyclic Graphs
View through CrossRef
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 (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 the Wiener polarity index. All these algorithms compute the indices in time O(n).
Title: Algorithms for Computing Wiener Indices of Acyclic and Unicyclic Graphs
Description:
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 (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 the Wiener polarity index.
All these algorithms compute the indices in time O(n).
Related Results
Extremal Gourava indices of unicyclic graphs
Extremal Gourava indices of unicyclic graphs
Abstract
Topological indices are useful molecular descriptors to measure Quantitative Structure-Activity Relationship (QSAR), Quantitative Structure-Property Relationship (...
Computing the Energy of Certain Graphs based on Vertex Status
Computing the Energy of Certain Graphs based on Vertex Status
Background:
The concept of Hückel molecular orbital theory is used to compute the graph energy numerically and graphically on the base of the status of a vertex.
Objective:
Our a...
Advancements in Quantum Computing and Information Science
Advancements in Quantum Computing and Information Science
Abstract: The chapter "Advancements in Quantum Computing and Information Science" explores the fundamental principles, historical development, and modern applications of quantum co...
Ordering Unicyclic Connected Graphs with Girth g ≥ 3 Having Greatest SK Indices
Ordering Unicyclic Connected Graphs with Girth g ≥ 3 Having Greatest SK Indices
For a graph, the SK index is equal to the half of the sum of the degrees of the vertices, the SK1 index is equal to the half of the product of the degrees of the vertices, and the ...
Twilight graphs
Twilight graphs
AbstractThis paper deals primarily with countable, simple, connected graphs and the following two conditions which are trivially satisfied if the graphs are finite:(a) there is an ...
Eigenspectral Analysis of Pendant Vertex- and Pendant Edge-Weighted Graphs of Linear Chains, Cycles, and Stars
Eigenspectral Analysis of Pendant Vertex- and Pendant Edge-Weighted Graphs of Linear Chains, Cycles, and Stars
Abstract
Three classes of pendent vertex- and pendant edge-weighted graphs of linear chains (class I), stars (class II), and cycles (class III) have been presented. ...
NORDHAUS – GADDUM TYPE RESULTS FOR WIENER LIKE INDICES OF GRAPHS
NORDHAUS – GADDUM TYPE RESULTS FOR WIENER LIKE INDICES OF GRAPHS
A Nordhaus - Gaddum type result is a lower or upper bound on sum or product of a parameter of a graph and its complement. This concept was introduced in 1956 by Nordhaus E. A., ...
On additive vertex labelings
On additive vertex labelings
<div class="page" title="Page 1"><div class="layoutArea"><div class="column"><p><span>In a quite general sense, additive vertex labelings are those fu...