三圈图的最小距离特征值
The Minimum Distance Eigenvalue of a Tricyclic Graph
糟玉英 1朱银芬 1王国平2
作者信息
- 1. 新疆工程学院数理学院,新疆 乌鲁木齐 830091
- 2. 新疆师范大学数学科学学院,新疆 乌鲁木齐 830017
- 折叠
摘要
设连通图G的点集V(G)={v1,v2,...,vn},D(G)=(dij)n×n是图G的距离矩阵,其中dij是vi到vj的距离.也称D(G)的最小特征值为图G的最小距离特征值.让E(G)表示图G的边集.当|E(G)|=|V(G)|+2时,G就被称为三圈图.在这篇文章里刻画了最小距离特征值在(-2-√2,-2]中的所有三圈图.
Abstract
Let G be a connected graph with vertex set V(G)={v1,v2,,vn}.Thedistance matrix of G is denoted by D(G)=(dij)n×n,where dij is the distance between vi and vj.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.
关键词
三圈图/距离矩阵/最小距离特征值Key words
tricyclic graphs/distance matrix/the least distance eigenvalue引用本文复制引用
基金项目
自治区自然科学青年基金(2022D01B136)
出版年
2024
NETL
NSTL
万方数据