Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/11519
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLiu W.-
dc.contributor.authorGuo Q.-
dc.contributor.authorZhang, Yusen-
dc.contributor.authorFENG L.-
dc.contributor.authorGutman, Ivan-
dc.date.accessioned2021-04-20T18:33:33Z-
dc.date.available2021-04-20T18:33:33Z-
dc.date.issued2017-
dc.identifier.issn0166-218X-
dc.identifier.urihttps://scidar.kg.ac.rs/handle/123456789/11519-
dc.description.abstract© 2017 Elsevier B.V. Let G be a simple connected graph with vertex set V(G). The matching polynomial of G is defined as MG(x)=∑k=0n∕2(−1)km(G,k)xn−2k, where m(G,k) denotes the number of ways in which k independent edges can be selected in G. Let λ1(G) be the largest root of MG(x). We determine the unicyclic graphs with the four largest and the two smallest λ1(G)-values.-
dc.rightsrestrictedAccess-
dc.sourceDiscrete Applied Mathematics-
dc.titleFurther results on the largest matching root of unicyclic graphs-
dc.typearticle-
dc.identifier.doi10.1016/j.dam.2016.12.022-
dc.identifier.scopus2-s2.0-85009792159-
Appears in Collections:Faculty of Science, Kragujevac

Page views(s)

135

Downloads(s)

6

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.