摘要
令G是一个简单连通图.如果连通图G被删除少于k条边后仍然保持连通,则称G是k-边连通的.基于图G或补图■的距离谱半径,距离无符号拉普拉斯谱半径,Wiener指数和Harary指数,提供了图G是k-边连通的新充分谱条件,从而建立了图的代数性质与结构性质之间的紧密联系.
Let G be a simple and connected graph.A graph G is k-edge-connected if it has at least two vertices and remains connected whenever fewer than k edges are deleted.In this paper,we provide some new sufficient conditions for a graph being k-edge-connected in terms of the distance spectral radius,the distance signless Laplacian spectral radius,Wiener index and Harary index of the graph or its complement.These results establish the relation between the algebraic and structural properties of a graph.
作者
贾会才
宋宏业
Jia Hui-cai;SONG Hong-ye(College of Science,Henan Institute of Engineering,Zhengzhou 451191,China;School of General Education,Beijing International Studies University,Beijing,100024,China;Department of Mathematics,School of Information,Renmin University of China,Beijing 100872,China)
出处
《数学的实践与认识》
北大核心
2020年第1期275-278,共4页
Mathematics in Practice and Theory
基金
国家自然科学基金青年项目(11701148,11801144)
河南省高等学校重点科研项目(18B110005).
