Results 241 to 250 of about 143,498 (274)
Some of the next articles are maybe not open access.
On Wiener and terminal Wiener index of graphs
International Journal of Biomathematics, 2015The 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 ...
Babujee, J. Baskar, Senbagamalar, J.
openaire +2 more sources
WIENER INDEX AND TRACEABLE GRAPHS
Bulletin of the Australian Mathematical Society, 2012AbstractIn this short paper, we show that, with three exceptions, if the Wiener index of a connected graph of order $n$ is at most $(n+ 5)(n- 2)/ 2$, then it is traceable.
openaire +1 more source
Wuhan University Journal of Natural Sciences, 2004
Based on distance matrixW, the novel topological indexW F is defined by the matricesX, W, L, asW F=WXL. WhereX is a row matrix, which expresses the bonding characteristics between adjacent atoms;L is a column matrix expressing the characteristic of vertexes in molecules;W is a distance matrix, which expresses the ...
Huang Yun-ping +3 more
openaire +1 more source
Based on distance matrixW, the novel topological indexW F is defined by the matricesX, W, L, asW F=WXL. WhereX is a row matrix, which expresses the bonding characteristics between adjacent atoms;L is a column matrix expressing the characteristic of vertexes in molecules;W is a distance matrix, which expresses the ...
Huang Yun-ping +3 more
openaire +1 more source
Relation between hyper-Wiener and Wiener index
Chemical Physics Letters, 2002Abstract An identity between the hyper-Wiener index ( WW ) and the Wiener index ( W ) of a tree is deduced, showing that these two molecular-structure-descriptors are more intimately connected than earlier believed. Let T be a tree on n vertices and e be its edge.
openaire +1 more source
Acta Applicandae Mathematicae, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wu, Xiaoying, Liu, Huiqing
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wu, Xiaoying, Liu, Huiqing
openaire +1 more source
Modification of the Wiener index 4
Journal of Computational Chemistry, 2004AbstractA novel topological index WF is defined by the matrices X, W, and L as WF = XWL. Where L is a column vector expressing the characteristic of vertices in the molecule; X is a row vector expressing the bonding characteristics between adjacent atoms; W is a reciprocal distance matrix.
Feng, Yang +2 more
openaire +2 more sources
Modification of the Wiener Index. 2
Journal of Chemical Information and Computer Sciences, 2003A novel topological index based on the Wiener Index is proposed as W = 1/2, summation(n/ij)=S*(ij) the element S*(ij) of the distance matrix is defined either as S*(ij)= square root (E(i)E(j)/R(ij) (atoms i and j are adjacent) or as S*(ij)=(j-i+1)square root (E(i)...xE /R(ij) (atoms i and j are not adjacent), where E(i) and E(j) represent the total ...
Feng, Yang +3 more
openaire +2 more sources
Chemical Physics Letters, 2002
Abstract Comparison with the Wiener number and the molecular connectivity index, a novel set of Wiener indexes ( m W p , m W pc , m W c and m W ch ) were defined, which are named the extended Wiener index. The potential usefulness of the extended Wiener index in QSAR/QSPR is evaluated by its
openaire +1 more source
Abstract Comparison with the Wiener number and the molecular connectivity index, a novel set of Wiener indexes ( m W p , m W pc , m W c and m W ch ) were defined, which are named the extended Wiener index. The potential usefulness of the extended Wiener index in QSAR/QSPR is evaluated by its
openaire +1 more source
2019
Binary trees are enormously used in data structure as they can be easily stored, manipulated, and retrieved. The most straightforward and extensive applications of binary trees are in the study of computer searching and sorting methods, binary identification problems, and variable binary codes.
L. Nirmala Rani +2 more
openaire +1 more source
Binary trees are enormously used in data structure as they can be easily stored, manipulated, and retrieved. The most straightforward and extensive applications of binary trees are in the study of computer searching and sorting methods, binary identification problems, and variable binary codes.
L. Nirmala Rani +2 more
openaire +1 more source
A Note on The Weighted Wiener Index and The Weighted Quasi-Wiener Index
2017In this study, we consider the weighted Wiener index and the weighted quasi-Wiener index of simple connected weighted graphs and we find some bounds for the weighted Wiener index and the weighted quasi-Wiener index of the weighted graphs. Moreover, we obtain some results by using these bounds for weighted and unweighted graphs.
Büyükköse, Şerife +2 more
openaire +2 more sources

