Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/12307
Full metadata record
DC FieldValueLanguage
dc.rights.licenserestrictedAccess-
dc.contributor.authorDivnić T.-
dc.contributor.authorMilivojević M.-
dc.contributor.authorPavlović, Ljiljana-
dc.date.accessioned2021-04-20T20:31:17Z-
dc.date.available2021-04-20T20:31:17Z-
dc.date.issued2014-
dc.identifier.issn0166-218X-
dc.identifier.urihttps://scidar.kg.ac.rs/handle/123456789/12307-
dc.description.abstractLet G(k,n) be the set of connected simple n-vertex graphs with minimum vertex degree k. The geometric-arithmetic index GA(G) of a graph G is defined by GA(G)=Σuv2√du dv/du+dv, where d(u) is the degree of vertex u and the summation extends over all edges uv of G. In this paper we find for k ≥ ⌈k0⌉, with k0=q0(n-1), where q0≈0.088 is the unique positive root of the equation q √ q + q + 3 √q-1 = 0, extremal graphs in G(k,n) for which the geometric-arithmetic index attains its minimum value, or we give a lower bound. We show that when k or n is even, the extremal graphs are regular graphs of degree k. © 2013 Elsevier B.V. All rights reserved.-
dc.rightsinfo:eu-repo/semantics/restrictedAccess-
dc.sourceDiscrete Applied Mathematics-
dc.titleExtremal graphs for the geometric-arithmetic index with given minimum degree-
dc.typearticle-
dc.identifier.doi10.1016/j.dam.2013.08.001-
dc.identifier.scopus2-s2.0-84887989270-
Appears in Collections:Faculty of Science, Kragujevac

Page views(s)

475

Downloads(s)

8

Files in This Item:
File Description SizeFormat 
PaperMissing.pdf
  Restricted Access
29.86 kBAdobe PDFThumbnail
View/Open


Items in SCIDAR are protected by copyright, with all rights reserved, unless otherwise indicated.