The Characteristic Polynomial of the Laplacian Matrix of a Rooted Balanced k -Ary Tree

Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/1575

DC Field	Value	Language
dc.contributor.author	Stanić, Zoran	en_US
dc.date.accessioned	2025-03-10T08:38:57Z	-
dc.date.available	2025-03-10T08:38:57Z	-
dc.date.issued	2025	-
dc.identifier.uri	https://research.matf.bg.ac.rs/handle/123456789/1575	-
dc.description.abstract	We give the explicit formula for the characteristic polynomial of the Laplacian matrix of every rooted balanced k-ary tree of depth r.	en_US
dc.language.iso	en	en_US
dc.publisher	World Scientific	en_US
dc.relation.ispartof	Algebra Colloquium	en_US
dc.subject	rooted balanced k-ary tree	en_US
dc.subject	Laplacian matrix	en_US
dc.subject	characteristic polynomial	en_US
dc.subject	generalized Fibonacci polynomial	en_US
dc.subject	eigenvalue	en_US
dc.title	The Characteristic Polynomial of the Laplacian Matrix of a Rooted Balanced k -Ary Tree	en_US
dc.type	Article	en_US
dc.identifier.doi	10.1142/s1005386725000045	-
dc.contributor.affiliation	Numerical Mathematics and Optimization	en_US
dc.relation.issn	1005-3867	en_US
dc.description.rank	M23	en_US
dc.relation.firstpage	53	en_US
dc.relation.lastpage	58	en_US
dc.relation.volume	31	en_US
dc.relation.issue	01	en_US
item.openairetype	Article	-
item.fulltext	No Fulltext	-
item.cerifentitytype	Publications	-
item.grantfulltext	none	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.languageiso639-1	en	-
crisitem.author.dept	Numerical Mathematics and Optimization	-
crisitem.author.orcid	0000-0002-4949-4203	-
Appears in Collections:	Research outputs

Check