Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/11519
Title: Further results on the largest matching root of unicyclic graphs
Authors: Liu W.
Guo Q.
Zhang, Yusen
FENG L.
Gutman I.
Journal: Discrete Applied Mathematics
Issue Date: 20-Apr-2017
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.
URI: https://scidar.kg.ac.rs/handle/123456789/11519
Type: Article
DOI: 10.1016/j.dam.2016.12.022
ISSN: 0166218X
SCOPUS: 85009792159
Appears in Collections:University Library, Kragujevac
[ Google Scholar ]

Page views(s)

13

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


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