三圈图的最小距离特征值  

The Minimum Distance Eigenvalue of a Tricyclic Graph

作　　者：糟玉英 朱银芬 王国平[2] ZAO Yu-ying;ZHU Yin-fen;WANG Guo-ping(Department of Mathematics and Physics,Xinjiang Institute of Engineering,Urumqi 830023,China;Department of Mathematics,Xinjiang Normal University,Urumqi 830017,China)

机构地区：[1]新疆工程学院数理学院,新疆乌鲁木齐830091 [2]新疆师范大学数学科学学院,新疆乌鲁木齐830017

出　　处：《数学的实践与认识》2024年第10期186-193,共8页Mathematics in Practice and Theory

基　　金：自治区自然科学青年基金(2022D01B136)。

摘　　要：设连通图G的点集V(G)={v_(1),v_(2),……,v_(n)),D(G)=(d_(ij))_(n×n)是图G的距离矩阵,其中d_(ij)是v_(i)到v_(j)的距离.也称D(G)的最小特征值为图G的最小距离特征值.让E(G)表示图G的边集.当|E(G)|=|V(G)|+2时,G就被称为三圈图.在这篇文章里刻画了最小距离特征值在(-2-√2,-2]中的所有三圈图.Let G be a connected graph with vertex set V(G)={v_(1),v_(2),……,v_(n)).The distance matrix of G is denoted by D(G)=(d_(ij))_(n×n),where dij is the distance between v_(i) and v_(j).The least eigenvalue of D(G)is also called the least distance eigenvalue of G.Suppose E(G)is the edge set of graph G.Then G is tricyclic if it satisfies|E(G)|=|V(G)|+2.In this paper,all tricyclic graphs with least distance eigenvalues in(-2-√2,-2]are determined.

关 键 词：三圈图 距离矩阵 最小距离特征值 

分 类 号：O157.5[理学—数学]