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

共 18 条

[1] [Anonymous], 1985, Matrix Analysis
[2] [Anonymous], 1987, North-Holland Mathematics Studies, DOI DOI 10.1016/S0304-0208(08)73232-8
[3] Distance spectra of graphs: A survey
Aouchiche, Mustapha
Hansen, Pierre
[J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2014, 458 : 301 - 386
[4] Berge C., 1976, North-Holland mathematical library, V6
[5] Berge C., 1989, N HOLLAND MATH LIB, V45
[6] DISTANCE MATRIX OF A TREE
EDELBERG, M
GAREY, MR
GRAHAM, RL
[J]. DISCRETE MATHEMATICS, 1976, 14 (01) : 23 - 39
[7] DISTANCE MATRIX POLYNOMIALS OF TREES
GRAHAM, RL
LOVASZ, L
[J]. ADVANCES IN MATHEMATICS, 1978, 29 (01) : 60 - 88
[8] ADDRESSING PROBLEM FOR LOOP SWITCHING
GRAHAM, RL
POLLAK, HO
[J]. BELL SYSTEM TECHNICAL JOURNAL, 1971, 50 (08): : 2495 - +
[9] On the distance spread of cacti and bicyclic graphs
Liang, Yijuan
Zhou, Bo
[J]. DISCRETE APPLIED MATHEMATICS, 2016, 206 : 195 - 202
[10] Distance spectral radius of uniform hypergraphs
Lin, Hongying
Zhou, Bo
[J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2016, 506 : 564 - 578

← 1 2 →