One common problem in spectral graph theory is to determine which graphs, under some prescribed constraints, maximize or minimize the spectral radius of the adjacency matrix. Here we consider minimizers in the set of bidegreed, or biregular, graphs with pendant vertices and given degree sequence. In this setting, we consider a particular graph perturbation whose effect is to decrease the spectral radius. Hence we restrict the structure of minimizers for k-cyclic degree sequences.
Perturbations on bidegreed graphs minimizing the spectral radius / Belardo, Francesco. - In: ELECTRONIC NOTES IN DISCRETE MATHEMATICS. - ISSN 1571-0653. - 40:(2013), pp. 33-37. [10.1016/j.endm.2013.05.007]
Perturbations on bidegreed graphs minimizing the spectral radius
BELARDO, Francesco
2013
Abstract
One common problem in spectral graph theory is to determine which graphs, under some prescribed constraints, maximize or minimize the spectral radius of the adjacency matrix. Here we consider minimizers in the set of bidegreed, or biregular, graphs with pendant vertices and given degree sequence. In this setting, we consider a particular graph perturbation whose effect is to decrease the spectral radius. Hence we restrict the structure of minimizers for k-cyclic degree sequences.File | Dimensione | Formato | |
---|---|---|---|
Perturbations on bidegreed graphs minimizing the spectral radius.pdf
non disponibili
Descrizione: Articolo completo in Post-print
Tipologia:
Documento in Post-print
Licenza:
Accesso privato/ristretto
Dimensione
170.62 kB
Formato
Adobe PDF
|
170.62 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.