If e is an edge of G connecting vertices u and v, then we write e = uv or e = vu. For , let and be respectively the number of vertices of G lying closer to vertex u than to vertex v and the number of vertices of G lying closer to vertex v than to vertex u.
The Szeged index of Dendrimer Nanostar of the following figure can be calculated by[2]
References
^Gutman, I. (1994), "A formula for the Wiener number of trees and its extension to graphs containing cycles", Graph Theory Notes, NY, 27: 9–15.
^Khalifeh, M.H.; Darafsheh, M.R; Jolany, H. (2011), "The Wiener, Szeged, and PI Indices of a Dendrimer Nanostar", Journal of Computational and Theoretical Nanoscience, 8 (2): 220–223, Bibcode:2011JCTN....8..220K, doi:10.1166/jctn.2011.1681.