An explicit upper bound on disparity for trees of a given diameter

Autor:	Charles R. Johnson, Isaac Cinzori, Hannah Lang
Rok vydání:	2021
Předmět:	Combinatorics Algebra and Number Theory Symmetric matrix Graph (abstract data type) 010103 numerical & computational mathematics 0101 mathematics 01 natural sciences Tree (graph theory) Upper and lower bounds Eigenvalues and eigenvectors Mathematics
Zdroj:	Linear and Multilinear Algebra. 70:4584-4596
ISSN:	1563-5139 0308-1087
DOI:	10.1080/03081087.2021.1887070
Popis:	It is known that the minimum number of distinct eigenvalues c ( T ) of a symmetric matrix whose graph is a given tree T is at least the diameter d ( T ) of that tree. However, the disparity c ( T )...
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::793df3bb04361791eaab6fdeaa590ead https://doi.org/10.1080/03081087.2021.1887070 Zobrazit plný text záznamu