Results 11 to 20 of about 4,539,869 (304)
The quotients between the (revised) Szeged index and Wiener index of graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 Let $Sz(G),Sz^*(G)$ and $W(G)$ be the Szeged index, revised Szeged index and Wiener index of a graph $G.$ In this paper, the graphs with the fourth, fifth, sixth and seventh largest Wiener indices among all unicyclic graphs of order $n\geqslant 10$ are ...
Huihui Zhang, Jing Chen, Shuchao Li
doaj +3 more sources
Note of the hyper-Wiener index [PDF]
Journal of the Serbian Chemical Society, 2003 The hyper-Wiener index WW of a chemical tree T is defined as the sum of the products n1n2, over all pairs υ,ν of vertices of T, where n1 and n2 are the number of vertices of T, lying on the two sides of the path which connects υ and ν.
Gutman Ivan +2 more
doaj +4 more sources
Peripheral Wiener index of a graph
Communications in Combinatorics and Optimization, 2017 The {\em eccentricity} of a vertex $v$ is the maximum distance between $v$ and any other vertex. A vertex with maximum eccentricity is called a peripheral vertex.
K.P. Narayankar, S.B. Lokesh
doaj +2 more sources
Five results on maximizing topological indices in graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 In this paper, we prove a collection of results on graphical indices. We determine the extremal graphs attaining the maximal generalized Wiener index (e.g. the hyper-Wiener index) among all graphs with given matching number or independence number.
Stijn Cambie
doaj +1 more source
On the Wiener index of orientations of graphs [PDF]
Discrete Applied Mathematics, 2022 The Wiener index of a strong digraph $D$ is defined as the sum of the distances between all ordered pairs of vertices. This definition has been extended to digraphs that are not necessarily strong by defining the distance from a vertex $a$ to a vertex $b$
P. Dankelmann
semanticscholar +1 more source
Wiener Index of Some Brooms [PDF]
Computer Science Journal of Moldova, 2022 In the field of chemical graph theory, a Wiener (topological) index is a type of a molecular descriptor that is calculated based on the molecular graph of alkanes.
Julian D. Allagan
doaj +1 more source
The First Zagreb Index, The Wiener Index, and The Gutman Index of The Power of Dihedral Group
CAUCHY, 2023 Research on graphs combined with groups is an interesting topic in the field of combinatoric algebra where graphs are used to represent a group. One type of graph representation of a group is a power graph.
Evi Yunartika Asmarani +5 more
semanticscholar +1 more source
Wiener Index Calculation on the Benzenoid System: A Review Article
Jurnal Matematika Integratif, 2023 The Weiner index is considered one of the basic descriptors of fixed interconnection networks because it provides the average distance between any two nodes of the network.
Dwindi Agryanti Johar +2 more
doaj +1 more source
On the Wiener index and the hyper-Wiener index of the Kragujevac trees
Proyecciones (Antofagasta), 2023 In this paper, the Wiener index and the hyper-Wiener index of the Kragujevac trees is computed in term of its vertex degrees. As application, we obtain an upper bond and a lower bound for the Wiener index and the hyper-Wiener index of these trees.
A. Heydari
semanticscholar +1 more source
Wiener index and applications in the Neutrosophic graphs [PDF]
Neutrosophic Sets and Systems, 2021 In this article, we have examined the Wiener index in neutrosophic graphs. Wiener index is one of the most important topological indices. This index is a distance-based index that is calculated based on the geodesic distance between two vertices.
Masoud Ghods, Zahra Rostami
doaj +1 more source