
<oai_dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/">
  <dc:identifier>https://phaidrabg.bg.ac.rs/o:29028</dc:identifier>
  <dc:identifier>ISSN: 1450-9628</dc:identifier>
  <dc:title xml:lang="eng">Note on the unicyclic graphs with the first three largest Wiener indices</dc:title>
  <dc:rights>All rights reserved</dc:rights>
  <dc:language>eng</dc:language>
  <dc:source>Kragujevac Journal of Mathematics 42(4)</dc:source>
  <dc:creator id="https://orcid.org/0000-0001-6295-8298">Glogić, Edin</dc:creator>
  <dc:creator>Pavlović, Ljiljana</dc:creator>
  <dc:subject xml:lang="eng">Keywords: Kirchhoff index, Laplacian eigenvalues(of a graph), vertex degree</dc:subject>
  <dc:format>application/pdf</dc:format>
  <dc:format>388543 bytes</dc:format>
  <dc:date>2018</dc:date>
  <dc:description xml:lang="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.
</dc:description>
  <dc:type>info:eu-repo/semantics/article</dc:type>
</oai_dc:dc>