Further results on the largest matching root of unicyclic graphs

Please use this identifier to cite or link to this item: https://scidar.kg.ac.rs/handle/123456789/11519

Full metadata record

DC Field	Value	Language
dc.rights.license	restrictedAccess	-
dc.contributor.author	Liu W.	-
dc.contributor.author	Guo Q.	-
dc.contributor.author	Zhang, Yusen	-
dc.contributor.author	FENG L.	-
dc.contributor.author	Gutman, Ivan	-
dc.date.accessioned	2021-04-20T18:33:33Z	-
dc.date.available	2021-04-20T18:33:33Z	-
dc.date.issued	2017	-
dc.identifier.issn	0166-218X	-
dc.identifier.uri	https://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.rights	info:eu-repo/semantics/restrictedAccess	-
dc.source	Discrete Applied Mathematics	-
dc.title	Further results on the largest matching root of unicyclic graphs	-
dc.type	article	-
dc.identifier.doi	10.1016/j.dam.2016.12.022	-
dc.identifier.scopus	2-s2.0-85009792159	-
Appears in Collections:	Faculty of Science, Kragujevac

471

10

Files in This Item:

File	Description	Size	Format
PaperMissing.pdf Restricted Access		29.86 kB	Adobe PDF	View/Open

SCIDAR - A Digital Archive of the University of Kragujevac