More trees with large energy and small size

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	Gutman, Ivan	-
dc.contributor.author	Furtula, Boris	-
dc.contributor.author	Andriantiana, Eric Ould Dadah	-
dc.contributor.author	Cvetić, Mila	-
dc.date.accessioned	2023-03-20T10:59:55Z	-
dc.date.available	2023-03-20T10:59:55Z	-
dc.date.issued	2012	-
dc.identifier.issn	0340-6253	en_US
dc.identifier.uri	https://scidar.kg.ac.rs/handle/123456789/17380	-
dc.description.abstract	In a previous paper [E. O. D. Andriantiana, MATCH Commun. Math Comput. Chem. 68 (2012) 000–000] trees with a fixed number n of vertices were ordered according to their energy, and a large number of trees with greatest energy were characterized. These results, however, hold only if n is large enough. We now analyze the energy–ordering of trees for small values of n (up to 100) and establish the first few greatest–energy species. The results obtained for small values of n significantly differ from those valid for large values of n.	en_US
dc.language.iso	en_US	en_US
dc.relation.ispartof	MATCH Communications in Mathematical and in Computer Chemistry	en_US
dc.subject	graph energy	en_US
dc.subject	trees	en_US
dc.subject	eigenvalues of a graph	en_US
dc.title	More trees with large energy and small size	en_US
dc.type	article	en_US
dc.description.version	Published	en_US
dc.type.version	PublishedVersion	en_US
Appears in Collections:	Faculty of Science, Kragujevac

46

7

Files in This Item:

File	Description	Size	Format
paper0083.pdf		179.12 kB	Adobe PDF	View/Open

SCIDAR - A Digital Archive of the University of Kragujevac