Results 1 to 10 of about 28,315 (192)
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 +6 more sources
Modified hyper-Wiener index of trees
Discrete Applied Mathematics, 2023 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
I Z Milovanović, E I Milovanović
exaly +3 more sources
Hyper-Wiener index and Laplacian spectrum [PDF]
Journal of the Serbian Chemical Society, 2003 The hyper-Wiener index WWW of a chemical tree T is defined as the sum of the product n1 n2 n3, over all pairs u, u 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 u and u, and n3 is the
IVAN GUTMAN
doaj +5 more sources
The hyper-Wiener index of graph operations
Computers and Mathematics With Applications, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
H Yousefi-Azari, Ali Reza Ashrafi
exaly +4 more sources
The hyper-Wiener index of the generalized hierarchical product of graphs
Discrete Applied Mathematics, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mehdi Eliasi
exaly +4 more sources
The Wiener index, degree distance index and Gutman index of composite hypergraphs and sunflower hypergraphs [PDF]
Heliyon, 2022 Topological invariants are numerical parameters of graphs or hypergraphs that indicate its topology and are known as graph or hypergraph invariants. In this paper, topological indices of hypergraphs such as Wiener index, degree distance index and Gutman ...
Sakina Ashraf +3 more
doaj +3 more sources
Maximum Zagreb index, minimum hyper-Wiener index and graph connectivity
Applied Mathematics Letters, 2009 AbstractIn this work we show that among all n-vertex graphs with edge or vertex connectivity k, the graph G=Kk∨(K1+Kn−k−1), the join of Kk, the complete graph on k vertices, with the disjoint union of K1 and Kn−k−1, is the unique graph with maximum sum of squares of vertex degrees.
Ali Behtoei +2 more
exaly +3 more sources
On the Steiner hyper-Wiener index of a graph [PDF]
Applied Mathematics and Computation, 2018 In this paper, we study the Steiner hyper-Wiener index of a graph, which is obtained from the standard hyper-Wiener index by replacing the classical graph distance with the Steiner distance. It is shown how this index is related to the Steiner Hosoya polynomial, which generalizes similar result for the standard hyper-Wiener index. Next, we show how the
Niko Tratnik
exaly +3 more sources
The Hyper-Wiener Index of Trees of Order n with Diameter d [PDF]
Discrete Dynamics in Nature and Society, 2016 The hyper-Wiener index is a kind of extension of the Wiener index, used for predicting physicochemical properties of organic compounds. The hyper-Wiener index WW(G) is defined as WW(G)=1/2∑u,v∈VGdGu,v+dG2u,v with the summation going over all pairs of ...
Gaixiang Cai +4 more
doaj +2 more sources
The hyper edge-Wiener index of corona product of graphs [PDF]
Transactions on Combinatorics, 2015 Let G be a simple connected graph. The edge-Wiener index W e (G) is the sum of all distances between edges in G , whereas the hyper edge-Wiener index WW e (G) is defined as {\footnotesize WW e (G)=12 W e (G)+12 W 2 e (G) }, where {footnotesize W 2 e ...
Abolghasem Soltani, Ali Iranmanesh
doaj +1 more source