TY - GEN
T1 - Sharp bounds on the spectral radius of Halin graphs and other k-outerplanar graphs
AU - Healy, Patrick
N1 - Publisher Copyright:
© 2014 IEEE.
PY - 2014/12/23
Y1 - 2014/12/23
N2 - We provide upper and lower bounds on the spectral radius of Halin graphs and some other classes of k-outerplanar graphs. For both the Halin and the k-outerplanar cases we provide examples where the bounds are met, thus demonstrating sharpness. The upper bound in the Halin case, improves upon Shu et al.'s claimed bound for a very wide class of graphs. A consequence of the upper bound is a generalization that holds for all graphs and which bounds the largest eigenvalue based on a graph partition; to the best of our knowledge this result is new also.
AB - We provide upper and lower bounds on the spectral radius of Halin graphs and some other classes of k-outerplanar graphs. For both the Halin and the k-outerplanar cases we provide examples where the bounds are met, thus demonstrating sharpness. The upper bound in the Halin case, improves upon Shu et al.'s claimed bound for a very wide class of graphs. A consequence of the upper bound is a generalization that holds for all graphs and which bounds the largest eigenvalue based on a graph partition; to the best of our knowledge this result is new also.
UR - http://www.scopus.com/inward/record.url?scp=84921365396&partnerID=8YFLogxK
U2 - 10.1109/CoDIT.2014.6996859
DO - 10.1109/CoDIT.2014.6996859
M3 - Conference contribution
AN - SCOPUS:84921365396
T3 - Proceedings - 2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014
SP - 7
EP - 12
BT - Proceedings - 2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014
A2 - Kacem, Imed
A2 - Laroche, Pierre
A2 - Roka, Zsuzsanna
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014
Y2 - 3 November 2014 through 5 November 2014
ER -