Bidegreed trees with small index

DC Field	Value	Language
dc.contributor.author	Belardo, Francesco	en
dc.contributor.author	Li Marzi, Enzo	en
dc.contributor.author	Simić, Slobodan	en
dc.date.accessioned	2020-05-01T20:12:49Z	-
dc.date.available	2020-05-01T20:12:49Z	-
dc.date.issued	2009-06-22	en
dc.identifier.issn	0340-6253	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/1159	-
dc.description.abstract	Let T△n be the class of trees on n vertices whose all vertices, other than pendant ones, are of degree △ (bidegreed trees). In this paper we consider some problems related to the index (largest eigenvalue) of bidegreed trees focusing our attention on those trees with small index. In particular, we identify those trees from T△n whose index is minimal.	en
dc.publisher	Faculty of Science, University of Kragujevac	-
dc.relation	MIUR (cofin “Strutture geometriche, Combinatoria e loro Applicazioni”).	-
dc.relation	Serbian Ministry of Science, Project 144015G	-
dc.relation.ispartof	match : Communications in Mathematical and in Computer Chemistry	en
dc.title	Bidegreed trees with small index	en
dc.type	Article	en
dc.identifier.scopus	2-s2.0-67249092164	en
dc.contributor.affiliation	Mathematical Institute of the Serbian Academy of Sciences and Arts	-
dc.relation.firstpage	503	en
dc.relation.lastpage	515	en
dc.relation.issue	2	en
dc.relation.volume	61	en
dc.description.rank	M21a	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.openairetype	Article	-
item.cerifentitytype	Publications	-
item.fulltext	No Fulltext	-
item.grantfulltext	none	-

8

checked on Nov 24, 2024

16

checked on Nov 24, 2024

Check