Indices of trees with a prescribed diameter

DC Field	Value	Language
dc.contributor.author	Simić, Slobodan	en
dc.contributor.author	Zhou, Bo	en
dc.date.accessioned	2020-05-01T20:12:50Z	-
dc.date.available	2020-05-01T20:12:50Z	-
dc.date.issued	2007-10-01	en
dc.identifier.issn	1452-8630	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/1168	-
dc.description.abstract	The index of a graph is is the largest eigenvalue of its adjacency matrix. Let Tn,d be the class of trees with n vertices and diameter d. For all integers n and d with 4 ≤ d ≤ n - 3 we identify in Tn,d the tree with the k-th largest index for all k up to + 1 if d ≤ n - 4, or for all k up to if d = n - 3.	en
dc.publisher	School of Electrical Engineering, University of Belgrade	-
dc.relation	Serbian Ministry of Sciences, Project 144015G	-
dc.relation	National Natural Science Foundation of China, Project No. 10 671 076	-
dc.relation.ispartof	Applicable Analysis and Discrete Mathematics	en
dc.subject	Characteristic polynomial \| Diameter \| Index \| Spectrum \| Tree	en
dc.title	Indices of trees with a prescribed diameter	en
dc.type	Article	en
dc.identifier.doi	10.2298/AADM0702446S	en
dc.identifier.scopus	2-s2.0-45849129052	en
dc.contributor.affiliation	Mathematical Institute of the Serbian Academy of Sciences and Arts	-
dc.relation.firstpage	446	en
dc.relation.lastpage	454	en
dc.relation.issue	2	en
dc.relation.volume	1	en
item.openairetype	Article	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.cerifentitytype	Publications	-
item.grantfulltext	none	-
item.fulltext	No Fulltext	-

10

checked on Apr 17, 2024

18

checked on Apr 16, 2024

Check