中北大学学报（自然科学版）2018，Vol.39Issue(1)：32-37,6.DOI:10.3969/j.issn.1673-3193.2018.01.006
关于处处可断图类的最大谱半径
On the Maximum Spectral Radius of the Class of Everywhere Separable Graphs
武建1
作者信息
- 1. 山西财经大学 应用数学学院,山西 太原 030006
- 折叠
摘要
Abstract
Based on the research of complex networks,the applications of the class of everywhere separa-ble graphs were discussed.Through the investigation on the properties of this class of graphs,some fundamental topological structures of this class of graphs were obtained.The algebraic structures of this class of graphs were researched.Making use of the method of vertex partitioning of graphs,the extre-mal graph is attained as the spectral radius of everywhere separable graphs reach to its maximum.An upper bound of the maximum spectral radius is found.关键词
图论/顶点划分/谱半径/复杂网络/处处可断图Key words
graph theory/vertex partitioning/spectral radius/complex network/everywhere separable graph分类
数理科学引用本文复制引用
武建..关于处处可断图类的最大谱半径[J].中北大学学报（自然科学版）,2018,39(1):32-37,6.
