Results 231 to 240 of about 3,737,056 (274)

On Wiener index and Wiener polarity index of some polyomino chains

Journal of Discrete Mathematical Sciences and Cryptography, 2019
A graph invariant is a numerical value that depicts the structural properties of an entire graph. The Wiener index is the oldest distance based graph invariant which is defined as the sum of distances between all unordered pair of vertices of the graph G.
Muhammad Imran, Ismail Naci Cangül, Hafiz Muhammad Afzal Siddiqui   +2 more
exaly   +4 more sources

The edge-Wiener index and the edge-hyper-Wiener index of phenylenes [PDF]

Discrete Applied Mathematics, 2019
Besides the well known Wiener index, which sums up the distances between all the pairs of vertices, and the hyper-Wiener index, which includes also the squares of distances, the edge versions of both indices attracted a lot of attention in the recent years.
Petra Žigert Pleteršek
exaly   +3 more sources

Generalizations of Wiener Polarity Index and Terminal Wiener Index [PDF]

Graphs and Combinatorics, 2012
In theoretical chemistry, distance-based molecular structure descriptors are used for modeling physical, pharmacologic, biological and other properties of chemical compounds. We introduce a generalized Wiener polarity index $W_k (G)$ as the number of unordered pairs of vertices ${u, v}$ of $G$ such that the shortest distance $d (u, v)$ between $u$ and $
Aleksandar Ilic
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

COMPUTATION OF WIENER INDEX, RECIPROCAL WIENER INDEX AND PERIPHERAL WIENER INDEX USING ADJACENCY MATRIX

South East Asian J. of Mathematics and Mathematical Sciences, 2022
In this short paper, we establish formulae to compute Wiener index, reciprocal Wiener index and peripheral Wiener index of graphs using adjacency matrix.
Rajendra, R., Reddy, P. Siva Kota, Prabhavathi, M.   +2 more
openaire   +2 more sources

Wiener index and Steiner 3-Wiener index of graphs

Asian-European Journal of Mathematics, 2021
Let [Formula: see text] be a set of vertices of a connected graph [Formula: see text]. The Steiner distance of [Formula: see text] is the minimum size of a connected subgraph of [Formula: see text] containing all the vertices of [Formula: see text].
Kovše, Matjaž, Rasila, V. A., Vijayakumar, Ambat   +2 more
openaire   +1 more source

The Wiener index of hypergraphs

Journal of Combinatorial Optimization, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiangxiang Liu, Ligong Wang 0001, Xihe Li   +2 more
openaire   +2 more sources

On the Wiener Index of Graphs

Acta Applicandae Mathematicae, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wu, Xiaoying, Liu, Huiqing
openaire   +1 more source

An inequality between the edge-Wiener index and the Wiener index of a graph

Applied Mathematics and Computation, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martin Knor, Riste Skrekovski, Aleksandra Tepeh   +2 more
openaire   +1 more source

Wiener Index, Hyper-Wiener Index, Harary Index and Hamiltonicity Properties of graphs

Applied Mathematics-A Journal of Chinese Universities, 2019
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu, Gui-dong, Ren, Li-fang, Li, Xing-xing   +2 more
openaire   +1 more source