Spectral Radius of Hamiltonian Planar Graphs and
Outerplanar Graphs
周建;林翠琴;胡冠章
【期刊名称】《清华大学学报（英文版）》 【年(卷),期】2001(006)004
【摘要】The spectral radius is an important parameter of a graph related to networks. A method forestimating the spectral radius of each spanning subgraph is used to prove that the spectral radius of aHamiltonian planar graph of order n ≥ 4 is less than or equal toand the spectral radius of theouterplanar graph of order n ≥ 6 is less than or equal to, which are improvements overprevious results. A direction for further study is then suggested.`` 【总页数】5页(350-354) 【关键词】
【作者】周建;林翠琴;胡冠章
【作者单位】Department of Mathematical Sciences, Tsinghua University,;Department
of
Mathematical
Sciences,
Tsinghua
University,;Department of Mathematical Sciences, Tsinghua University, 【正文语种】中文 【中图分类】O1 【相关文献】
1.The Signless Laplacian Spectral Radii and Spread of Bicyclic Graphs [J],
Fengmei SUN; Ligong WANG
2.A Lower Bound for the Distance Signless Laplacian Spectral Radius of Graphs in Terms of Chromatic Number [J], Xiaoxin LI; Yizheng FAN; Shuping ZHA
3.The Signless Laplacian Spectral Radius of Tricyclic Graphs with a Given Girth [J], Lu QIAO; Ligong WANG
4.Laplacian Spectral Characterization of a Kind of Unicyclic Graphs [J], Luhua WANG; Ligong WANG
5.The Signless Laplacian Spectral Radius of Tricyclic Graphs with k Pendant Vertices [J], Jingming ZHANG; Jiming GUO
以上内容为文献基本信息，获取文献全文请下载
Spectral Radius of Hamiltonian Planar Graphs and Outerplanar Graphs
