
<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:date>2019</dc:date>
  <dc:description xml:lang="eng">Let G be a simple graph with vertex set V=V(G)={v_1,v_2,…,v_n} and edge set E=E(G). For v_i ϵ V(G), by d_i=d_i (G) we denote the degree (number of neighbors) of the vertex v_i. The second Zagreb index is defined as M_2 (G)=∑_(v_i v_j ϵE(G))=〖d_i d_j 〗. In this paper, we study the minimal and maximal second Zagreb index of trees with fixed diameter.</dc:description>
  <dc:type>info:eu-repo/semantics/article</dc:type>
  <dc:identifier>https://phaidrabg.bg.ac.rs/o:29014</dc:identifier>
  <dc:identifier>ISSN: 0340-6253</dc:identifier>
  <dc:rights>All rights reserved</dc:rights>
  <dc:title xml:lang="eng">On Kirchhoff Index, Laplacian Energy and Their Relations</dc:title>
  <dc:language>eng</dc:language>
  <dc:subject xml:lang="eng">Keywords:Graph energy, Kirchhoff index, Laplacian energy</dc:subject>
  <dc:format>application/pdf</dc:format>
  <dc:format>330044 bytes</dc:format>
  <dc:source>MATCH Communications in Mathematical and in Computer Chemistry 81(2)</dc:source>
  <dc:creator id="https://orcid.org/0000-0003-2209-9606">Milovanović, Igor</dc:creator>
  <dc:creator id="https://orcid.org/0000-0002-1905-4813">Milovanović, Emina</dc:creator>
  <dc:creator id="https://orcid.org/0000-0001-6295-8298">Glogić, Edin</dc:creator>
  <dc:creator>Matejić, Marjan</dc:creator>
</oai_dc:dc>
