o:29028 Note on the unicyclic graphs with the first three largest Wiener indices en Abstract: Let G = (V,E) be a simple connected graph with vertex set V and edge set E. Wiener index W(G) of a graph G is the sum of distances between all pairs of vertices in G, i.e., W(G) =∑_({u,v}⊆G)▒〖d_G (u,v)〗, where dG(u, v) is the distance between vertices u and v. In this note we give more precisely the unicyclic graphs with the first tree largest Wiener indices, that is, we found another class of graphs with the second largest Wiener index. Keywords: Kirchhoff index, Laplacian eigenvalues(of a graph), vertex degree 1552101 1450-9628 2023-05-04T11:26:00.399Z 44 no 46 Edin Glogić Državni univerzitet u Novom Pazaru 0000-0001-6295-8298 Ljiljana Pavlović person application/pdf 388543 https://phaidrabg.bg.ac.rs/o:29028 no yes 1 70 92000001 20A01 Kragujevac Journal of Mathematics 42 4 533 537 2018