Largest adjacency, signless Laplacian, and Laplacian H-eigenvalues of loose paths

Abstract

We investigate k-uniform loose paths. We show that the largest Heigenvalues of their adjacency tensors, Laplacian tensors, and signless Laplacian tensors are computable. For a k-uniform loose path with length l\ge \mathrm{3}, we show that the largest H-eigenvalue of its adjacency tensor is {((\mathrm{1}+\sqrt{\mathrm{5}})/\mathrm{2})}^{\mathrm{2}/k} when l=\mathrm{3} and \lambda (A)={\mathrm{3}}^{\mathrm{1}/k} when l=\mathrm{4}, respectively. For the case of l\ge \mathrm{5}, we tighten the existing upper bound 2. We also show that the largest H-eigenvalue of its signless Laplacian tensor lies in the interval (2, 3) when l\ge \mathrm{5}. Finally, we investigate the largest H-eigenvalue of its Laplacian tensor when k is even and we tighten the upper bound 4.

Keywords

H-eigenvalue / hypergraph / adjacency tensor / signless Laplacian tensor / Laplacian tensor / loose path

References

[1] Berge C. Hypergraphs: Combinatorics of Finite Sets. 3rd ed. Amsterdam: North-Holland, 1973

[2] Brouwer A E, Haemers W H. Spectra of Graphs. New York: Springer, 2011

[3] Chung F R K. Spectral Graph Theory. Providence: Amer Math Soc, 1997

[4] Copper J, Dutle A. Spectra of uniform hypergraphs. Linear Algebra Appl, 2012, 436: 3268–3292

[5] Grone R, Merris R. The Laplacian spectrum of a graph. SIAM J Discrete Math, 1994, 7: 221–229

[6] Hu S L, Huang Z H, Ling C, Qi L. On determinants and eigenvalue theory of tensors. J Symbolic Comput, 2013, 50: 508–531

[7] Hu S L, Qi L. Algebraic connectivity of an even uniform hypergraph. J Comb Optim, 2013, 24: 564–579

[8] Hu S L, Qi L. The eigenvectors of the zero Laplacian and signless Laplacian eigenvalues of a uniform hypergraph. Discrete Appl Math, 2014, 169: 140–151

[9] Hu S L, Qi L. The Laplacian of a uniform hypergraph. J Comb Optim, 2015, 29: 331–366

[10] Hu S L, Qi L, Shao J Y. Cored hypergraph, power hypergraph and their Laplacian H-eigenvalues. Linear Algebra Appl, 2013, 439: 2980–2998

[11] Hu S L, Qi L, Xie J S. The largest Laplacian and signless Laplacian H-eigenvalues of a uniform hypergraph. Linear Algebra Appl, 2015, 469: 1–27

[12] Li G, Qi L. The Z-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory. Numer Linear Algebra Appl, 2013, 20: 1001–1029

[13] Maherani M, Omidi G R, Raeisi G, Shasiah J. The Ramsey number of loose paths in 3-uniform hypergraphs. Electron J Combin, 2013, 20: #12

[14] Pearson K T, Zhang T. On spectral hypergraph theory of the adjacency tensor. Graphs Combin, 2014, 30: 1233–1248

[15] Peng X. The Ramsey number of generalized loose paths in uniform hypergraphs. arXiv: 1305.1073, 2013

[16] Qi L. Eigenvalues of a real supersymmetric tensor. J Symbolic Comput, 2005, 40: 1302–1324

[17] Qi L. Symmetric nonnegative tensors and copositive tensors. Linear Algebra Appl, 2013, 439: 228–238

[18] Qi L. H+-eigenvalues of Laplacian and signless Laplacian tensors. Commun Math Sci, 2014, 12: 1045–1064

[19] Qi L, Shao J Y, Wang Q. Regular uniform hypergraphs, s-cycles, s-paths and their largest Laplacian H-eigenvalues. Linear Algebra Appl, 2014, 443: 215–227

[20] Xie J, Chang A. H-eigenvalues of the signless Laplacian tensor for an even uniform hypergraph. Front Math China, 2013, 8: 107–127

[21] Xie J, Chang A. On the Z-eigenvalues of the signless Laplacian tensor for an even uniform hypergraph. Numer Linear Algebra Appl, 2013, 20: 1035–1045

[22] Yang Q Z, Yang Y N. Further results for Perron-Frobenius theorem for nonnegative tensors II. SIAM J Matrix Anal Appl, 2011, 32: 1236–1250

RIGHTS & PERMISSIONS

2014 Higher Education Press and Springer-Verlag Berlin Heidelberg