Uniform upper bound of the spectrum of rooted graphs

Chao Huang, Qingchen Liu, Changbin Yu

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

    Abstract

    Given the number of vertices only, we provide a uniform upper bound for spectrum of rooted graphs under the equal-neighbor rule, by acquiring the tight upper bound of the scrambling constant (SC). Furthermore, with the concept of canonical form of rooted graphs, we find the least connective topology of rooted graphs in the sense of SC.

    Original languageEnglish
    Title of host publication2016 Australian Control Conference, AuCC 2016
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages105-109
    Number of pages5
    ISBN (Electronic)9781922107909
    DOIs
    Publication statusPublished - 1 Mar 2017
    Event2016 Australian Control Conference, AuCC 2016 - Newcastle, Australia
    Duration: 3 Nov 20164 Nov 2016

    Publication series

    Name2016 Australian Control Conference, AuCC 2016

    Conference

    Conference2016 Australian Control Conference, AuCC 2016
    Country/TerritoryAustralia
    CityNewcastle
    Period3/11/164/11/16

    Cite this