On trees with smallest resolvent energy

DC Field	Value	Language
dc.contributor.author	Ghebleh, Mohammad	en
dc.contributor.author	Kanso, Ali	en
dc.contributor.author	Stevanović, Dragan	en
dc.date.accessioned	2020-05-01T20:12:58Z	-
dc.date.available	2020-05-01T20:12:58Z	-
dc.date.issued	2017-01-01	en
dc.identifier.issn	0340-6253	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/1233	-
dc.description.abstract	Let Pn-1(a) be the tree obtained by attaching a pendent vertex at position a of the (n-1)-vertex path Pn-1. We prove here a conjecture of Gutman et al. [MATCH Commun. Math. Comput. Chem. 73 (2015), 267{270] that Pn-1(a) has the a-th smallest resolvent Estrada index among all trees of order n, for 2 ≤ a ≤ 〈n/2〉, and show that the analogous result also holds for the resolvent energy.	en
dc.publisher	Faculty of Sciences, University of Kragujevac	-
dc.relation	Kuwait University, Research Grant No. SM10/15	-
dc.relation.ispartof	Match	en
dc.title	On trees with smallest resolvent energy	en
dc.type	Article	en
dc.identifier.scopus	2-s2.0-85017126372	en
dc.relation.firstpage	635	en
dc.relation.lastpage	654	en
dc.relation.issue	3	en
dc.relation.volume	77	en
dc.description.rank	M21a	-
item.openairetype	Article	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.cerifentitytype	Publications	-
item.grantfulltext	none	-
item.fulltext	No Fulltext	-
crisitem.author.orcid	0000-0003-2908-305X	-

7

checked on Apr 18, 2024

25

checked on Apr 16, 2024

Check