In this paper we consider bidegreed graphs, namely graphs whose vertices have degree either Δ or δ, with Δ≠δ. In the latter setting we identify those unicyclic graphs minimizing the largest eigenvalue of the adjacency matrix. We also give some remarks on the general case and a conjecture on the bicyclic case.
Bidegreed unicyclic graphs with minimum spectral radius
BELARDO, FRANCESCO;LI MARZI, Enzo
2013-01-01
Abstract
In this paper we consider bidegreed graphs, namely graphs whose vertices have degree either Δ or δ, with Δ≠δ. In the latter setting we identify those unicyclic graphs minimizing the largest eigenvalue of the adjacency matrix. We also give some remarks on the general case and a conjecture on the bicyclic case.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
