The index of trees with specified maximum degree

DC Field	Value	Language
dc.contributor.author	Simić, Slobodan	en
dc.contributor.author	Tošić, Dejan	en
dc.date.accessioned	2020-05-01T20:12:51Z	-
dc.date.available	2020-05-01T20:12:51Z	-
dc.date.issued	2005-01-01	en
dc.identifier.issn	0340-6253	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/1176	-
dc.description.abstract	Let Τ(n, Δ) be the set of all trees on n vertices with a given maximum degree Δ. In this paper we identify in Τ(n, Δ) the tree whose index, i.e. the largest eigenvalue of the adjacency matrix, has the maximum value.	en
dc.publisher	Faculty of Science, University of Kragujevac	-
dc.relation.ispartof	match : Communications in Mathematical and in Computer Chemistry	en
dc.title	The index of trees with specified maximum degree	en
dc.type	Article	en
dc.identifier.scopus	2-s2.0-29344459456	en
dc.relation.firstpage	351	en
dc.relation.lastpage	362	en
dc.relation.issue	2	en
dc.relation.volume	54	en
dc.description.rank	M22	-
item.openairetype	Article	-
item.fulltext	No Fulltext	-
item.grantfulltext	none	-
item.cerifentitytype	Publications	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-

18

checked on May 7, 2024

39

checked on May 7, 2024

Check