摘要
令G是一个简单连通图。若G包含长度为3到n的所有圈,则称图G是泛圈的。基于Wiener指数、Harary指数、距离谱半径和Harary谱半径,提供了图G是泛圈图的充分条件,从而建立了图的代数性质与结构性质之间的紧密联系。
Let G be a simple and connected graph.A graph G is pancyclic if it contains all possible cycles with length from three to the number of vertices.In this paper,we provide sufficient conditions for a graph to be pancyclic in terms of the Wiener index,the Harary index,the distance spectral radius and the Harary spectral radius of a graph,respectively.These results establish the relationship between algebraic properties and structural properties of graphs.
作者
贾会才
宋宏业
JIA Huicai;SONG Hongye(College of Sciences,Henan University of Engineering,Zhengzhou 451191,Henan,China;Ministry of Basic Science,Beijing International Studies University,Beijing 100024,China)
出处
《运筹学学报》
CSCD
北大核心
2023年第3期169-177,共9页
Operations Research Transactions
基金
国家自然科学基金(Nos.11701148,11801144)。
作者简介
通信作者:贾会才E-mail:jhc607@163.com。
