Naslov (eng)

Note on the unicyclic graphs with the first three largest Wiener indices

Autor

Glogić, Edin
Pavlović, Ljiljana

Opis (srp)

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.

Jezik

engleski

Datum

2018

Licenca

© All rights reserved

Predmet

Keywords: Kirchhoff index, Laplacian eigenvalues(of a graph), vertex degree

Deo kolekcije (1)

o:28516

Radovi nastavnika i saradnika Državnog univerziteta u Novom Pazaru