Note on the product of the largest and the smallest eigenvalue of a graph
Abstract: In this note, we use eigenvalue interlacing to derive an inequality between a graph’s maximum degree and its maximum and minimum adjacency eigenvalues. The equality case is fully characterized.
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
Note on the product of the largest and the smallest eigenvalue of a graph ; volume:12 ; number:1 ; year:2024 ; extent:6
Special matrices ; 12, Heft 1 (2024) (gesamt 6)
- Creator
-
Abiad, Aida
Dalfó, Cristina
Fiol, Miquel Àngel
- DOI
-
10.1515/spma-2024-0008
- URN
-
urn:nbn:de:101:1-2406031724587.061412959571
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:49 AM CEST
Data provider
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Abiad, Aida
- Dalfó, Cristina
- Fiol, Miquel Àngel