Interlacing families and the Hermitian spectral norm of digraphs

It is proved that for any finite connected graph $G$, there exists an orientation of $G$ such that the spectral radius of the corresponding Hermitian adjacency matrix is smaller or equal to the spectral radius of the universal cover of $G$ (with equality if and only if $G$ is a tree). This resolv...

全面介紹

Saved in:
書目詳細資料
Main Authors: Greaves, Gary Royden Watson, Mohar, Bojan, O, Suil
其他作者: School of Physical and Mathematical Sciences
格式: Article
語言:English
出版: 2021
主題:
在線閱讀:https://hdl.handle.net/10356/146676
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Nanyang Technological University
語言: English