Ediz, SuleymanCancan, Murat2025-05-102025-05-1020160974-1658https://hdl.handle.net/20.500.14720/4715Ediz, Suleyman/0000-0003-0625-3634; Cancan, Murat/0000-0002-8606-2274The Wiener index is the sum of distances between all pairs of vertices of a (connected) graph. In this paper, we define two novel graph invariants: the inverted distance and the inverted Wiener index. The inverted distance between any two different vertices u and v of a simple connected graph G is defined as: i(u, v) = D - d(u, v) + 1, where D denotes the diameter of G and d(u, v) denotes the distance of the vertices u and v. The inverted Wiener index of a simple connected graph G is defined as: IW(G) = Sigma(u not equal v) i(u, v), where the sum is taken over unordered pairs of vertices of G. We characterized maximum trees with respect to the inverted Wiener index.eninfo:eu-repo/semantics/closedAccessInverted DistanceInverted Wiener IndexWiener IndexAverage Inverted DistanceArticle171N/AN/A1119WOS:000375158500002