Note on the product of the largest and the smallest eigenvalue of a graph

Aida Abiad Monge; Cristina Dalfó; M.A. Fiol

doi:10.1515/spma-2024-0008

Note on the product of the largest and the smallest eigenvalue of a graph

Aida Abiad Monge (Corresponding author), Cristina Dalfó, M.A. Fiol

Algebraic Combinatorics

Onderzoeksoutput: Bijdrage aan tijdschrift › Tijdschriftartikel › Academic › peer review

1 Citaat (Scopus)

12 Downloads (Pure)

Samenvatting

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.

Originele taal-2	Engels
Artikelnummer	20240008
Aantal pagina's	6
Tijdschrift	Special Matrices
Volume	12
Nummer van het tijdschrift	1
DOI's	https://doi.org/10.1515/spma-2024-0008
Status	Gepubliceerd - 1 jan. 2024

Toegang tot document

10.1515/spma-2024-0008

pdfDefinitieve gepubliceerde versie, 2,7 MBLicentie: CC BY

Andere bestanden en links

Link naar publicatie in Scopus

Citeer dit

@article{e539c535bd064c619f71bf20b27ffbc5,

title = "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.",

keywords = "eigenvalues, interlacing, maximum degree",

author = "\{Abiad Monge\}, Aida and Cristina Dalf{\'o} and M.A. Fiol",

year = "2024",

month = jan,

day = "1",

doi = "10.1515/spma-2024-0008",

language = "English",

volume = "12",

journal = "Special Matrices",

issn = "2300-7451",

publisher = "Walter de Gruyter GmbH",

number = "1",

}

TY - JOUR

T1 - Note on the product of the largest and the smallest eigenvalue of a graph

AU - Abiad Monge, Aida

AU - Dalfó, Cristina

AU - Fiol, M.A.

PY - 2024/1/1

Y1 - 2024/1/1

N2 - 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.

AB - 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.

KW - eigenvalues

KW - interlacing

KW - maximum degree

UR - http://www.scopus.com/inward/record.url?scp=85196673348&partnerID=8YFLogxK

U2 - 10.1515/spma-2024-0008

DO - 10.1515/spma-2024-0008

M3 - Article

AN - SCOPUS:85196673348

SN - 2300-7451

VL - 12

JO - Special Matrices

JF - Special Matrices

IS - 1

M1 - 20240008

ER -

Note on the product of the largest and the smallest eigenvalue of a graph

Samenvatting

Toegang tot document

Andere bestanden en links

Vingerafdruk

Citeer dit