TY - GEN
T1 - Uniform upper bound of the spectrum of rooted graphs
AU - Huang, Chao
AU - Liu, Qingchen
AU - Yu, Changbin
N1 - Publisher Copyright:
© 2016 Engineers Australia.
PY - 2017/3/1
Y1 - 2017/3/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85016948634&partnerID=8YFLogxK
U2 - 10.1109/AUCC.2016.7868011
DO - 10.1109/AUCC.2016.7868011
M3 - Conference contribution
T3 - 2016 Australian Control Conference, AuCC 2016
SP - 105
EP - 109
BT - 2016 Australian Control Conference, AuCC 2016
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2016 Australian Control Conference, AuCC 2016
Y2 - 3 November 2016 through 4 November 2016
ER -