Sharp bounds on the spectral radius of Halin graphs and other k-outerplanar graphs

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014
EditorsImed Kacem, Pierre Laroche, Zsuzsanna Roka
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages7-12
Number of pages6
ISBN (Electronic)9781479967735
DOIs
Publication statusPublished - 23 Dec 2014
Event2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014 - Metz, France
Duration: 3 Nov 20145 Nov 2014

Publication series

NameProceedings - 2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014

Conference

Conference2014 International Conference on Control, Decision and Information Technologies, CoDIT 2014
Country/TerritoryFrance
CityMetz
Period3/11/145/11/14

Fingerprint

Dive into the research topics of 'Sharp bounds on the spectral radius of Halin graphs and other k-outerplanar graphs'. Together they form a unique fingerprint.

Cite this