The Szeged and the Wiener index of graphs
✍ Scribed by S. Klavžar; A. Rajapakse; I. Gutman
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 283 KB
- Volume
- 9
- Category
- Article
- ISSN
- 0893-9659
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Graph operations C 4 nanotube C 4 nanotorus q-multi-walled nanotube a b s t r a c t Let G be a graph. The distance d(u, v) between the vertices u and v of the graph G is equal to the length of a shortest path that connects u and v. The Wiener index W(G) is the sum of all distances between verti
Lower and upper bounds on Szeged index of connected (molecular) graphs are established as well as Nordhaus-Gaddum-type results, relating the Szeged index of a graph and of its complement.
Eliasi and Taeri [Extension of the Wiener index and Wiener polynomial, Appl. Math. Lett. 21 (2008) 916-921] introduced the notion of y-Wiener index of graphs as a generalization of the classical Wiener index and hyper Wiener index of graphs. They obtained some mathematical properties of this new def
The kth power of a graph G, denoted by G k , is a graph with the same vertex set as G such that two vertices are adjacent in G k if and only if their distance is at most k in G. The Wiener index is a distance-based topological index defined as the sum of distances between all pairs of vertices in a