COMPUTING WIENER INDEX OF HAC5C7[p, q] NANOTUBES BY GAP PROGRAM
Authors
Abstract:
The Wiener index of a graph Gis defined as W(G) =1/2[Sum(d(i,j)] over all pair of elements of V(G), where V (G) is the set of vertices of G and d(i, j) is the distance between vertices i and j. In this paper, we give an algorithm by GAP program that can be compute the Wiener index for any graph also we compute the Wiener index of HAC5C7[p, q] and HAC5C6C7[p, q] nanotubes by this program.
similar resources
A new algorithm for computing distance matrix and Wiener index of zig-zag polyhex nanotubes
The Wiener index of a graph G is defined as the sum of all distances between distinct vertices of G. In this paper an algorithm for constructing distance matrix of a zig-zag polyhex nanotube is introduced. As a consequence, the Wiener index of this nanotube is computed.
full textComputing Wiener and hyper–Wiener indices of unitary Cayley graphs
The unitary Cayley graph Xn has vertex set Zn = {0, 1,…, n-1} and vertices u and v are adjacent, if gcd(uv, n) = 1. In [A. Ilić, The energy of unitary Cayley graphs, Linear Algebra Appl. 431 (2009) 1881–1889], the energy of unitary Cayley graphs is computed. In this paper the Wiener and hyperWiener index of Xn is computed.
full textGeneralizations of Wiener Polarity Index and Terminal 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 generalizedWiener polarity indexWk(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. For k = 3, we get standard Wiener polarity index. ...
full textcomputing wiener and hyper–wiener indices of unitary cayley graphs
the unitary cayley graph xn has vertex set zn = {0, 1,…, n-1} and vertices u and v areadjacent, if gcd(uv, n) = 1. in [a. ilić, the energy of unitary cayley graphs, linear algebraappl. 431 (2009) 1881–1889], the energy of unitary cayley graphs is computed. in this paperthe wiener and hyperwiener index of xn is computed.
full textPeripheral Wiener Index of a Graph
The eccentricity of a vertex $v$ is the maximum distance between $v$ and anyother vertex. A vertex with maximum eccentricity is called a peripheral vertex.The peripheral Wiener index $ PW(G)$ of a graph $G$ is defined as the sum ofthe distances between all pairs of peripheral vertices of $G.$ In this paper, weinitiate the study of the peripheral Wiener index and we investigate its basicproperti...
full textComputation of detour index of TUHC6[2p, q] nanotubes for any p and q.
The detour d(i, j) between vertices i and j of a graph is the number of edges of the longest path connecting these vertices. The matrix whose (i, j)-entry is the detour between vertices i and j is called the detour matrix. The half sum D of detours between all pairs of vertices (in a connected graph) is the detour index, i.e., D = (1/2) Sigma(j) Sigma(i) d(i, j). In this paper, we computed the ...
full textMy Resources
Journal title
volume 3 issue None
pages 1- 12
publication date 2008-05
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023