Results 1 to 10 of about 1,075 (167)
Note of the hyper-Wiener index [PDF]
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
Hyper-Wiener index and Laplacian spectrum [PDF]
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 +4 more sources
On the Steiner hyper-Wiener index of a graph [PDF]
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
Modified hyper-Wiener index of trees
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
E I Milovanović
exaly +2 more sources
The hyper-Wiener index of graph operations
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
H Yousefi-Azari, A R Ashrafi
exaly +3 more sources
The edge-Wiener index and the edge-hyper-Wiener index of phenylenes [PDF]
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
An algorithm for the calculation of the hyper-Wiener index of benzenoid hydrocarbons [PDF]
An algorithm for the calculation of the hyper-Wiener index (WW) of benzenoid hydrocarbons (both cata- and pericondensed) is described, based on the consideration of pairs of elementary cuts of the corresponding benzenoid graph B. A pair of elementary cuts partitions the vertices of B into four classes.
Ivan Gutman, Sandi Klavžar
exaly +3 more sources
The Wiener index, degree distance index and Gutman index of composite hypergraphs and sunflower hypergraphs [PDF]
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 +2 more sources
The hyper-Wiener index of the generalized hierarchical product of graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mehdi Eliasi
exaly +3 more sources
Maximum Zagreb index, minimum hyper-Wiener index and graph connectivity
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 +2 more sources

