共 50 条
On Least Distance Eigenvalue of Uniform Hypergraphs
被引:3
|作者:
Lin, Hongying
[1
]
Zhou, Bo
[2
]
机构:
[1] Tianjin Univ, Ctr Appl Math, Tianjin 300072, Peoples R China
[2] South China Normal Univ, Sch Math Sci, Guangzhou 510631, Guangdong, Peoples R China
来源:
TAIWANESE JOURNAL OF MATHEMATICS
|
2018年
/
22卷
/
06期
关键词:
distance matrix;
least distance eigenvalue;
uniform hypergraph;
uniform hypertree;
uniform unicyclic hypergraph;
distance spread;
BICYCLIC GRAPHS;
SPREAD;
MATRIX;
TREES;
D O I:
10.11650/tjm/180201
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
For k >= 2, we determine the connected k-uniform hypergraphs with least distance eigenvalues in ((1 - root 33)/2, 0), the k-uniform hypertrees with least distance eigenvalues in [-2k, 0), and the k-uniform unicyclic hypergraphs with least distance eigenvalues in (-k+ 1 - root(k - 1)(k - 2), 0), respectively, and determine the k-uniform hypergraphs (hypertrees, respectively) with minimum distance spread.
引用
收藏
页码:1289 / 1307
页数:19
相关论文