140
Views
4
CrossRef citations to date
0
Altmetric
Articles

The minimum spectral radius of the r-uniform supertree having two vertices of maximum degree

Pages 2898-2918 | Received 30 Dec 2019, Accepted 30 Aug 2020, Published online: 20 Sep 2020

References

  • Cooper J, Dutle A. Spectra of uniform hypergraphs. Linear Algebra Appl. 2012;436:3268–3292. doi: 10.1016/j.laa.2011.11.018
  • Qi LQ. Eigenvalues of a real supersymmetric tensor. J Symb Comput. 2005;40:1302–1324. doi: 10.1016/j.jsc.2005.05.007
  • Lim LH. Singular values and eigenvalues of tensors: a variational approach. Proceeding of the 1st IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMSAP'05; p. 129–132.
  • Li HH, Shao JY, Qi LQ. The extremal spectral radii of k-uniform supertrees. J Comb Optim. 2016;32:741–764. doi: 10.1007/s10878-015-9896-4
  • Hu SL, Qi LQ, Shao JY. Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues. Linear Algebra Appl. 2013;439:2980–2998. doi: 10.1016/j.laa.2013.08.028
  • Ouyang C, Qi LQ, Yuan XY. The first few unicyclic and bicyclic hypergraphs with largest spectral radii. Linear Algebra Appl. 2017;527:141–162. doi: 10.1016/j.laa.2017.04.008
  • Yuan XY, Shao JY, Shan HY. Ordering of some uniform supertrees with larger spectral radii. Linear Algebra Appl. 2016;495:206–222. doi: 10.1016/j.laa.2016.01.031
  • Su L, Kang LY, Li HH, et al. The matching polynomials and spectral radii of uniform supertrees. Electron J Comb. 2018;25:P4.13. doi: 10.37236/7839
  • Xiao P, Wang LG, Du YF. The first two largest spectral radii of uniform supertrees with given diameter. Linear Algebra Appl. 2018;536:103–119. doi: 10.1016/j.laa.2017.09.009
  • Xiao P, Wang LG, Lu Y. The maximum spectral radii of uniform supertrees with given degree sequences. Linear Algebra Appl. 2017;523:33–45. doi: 10.1016/j.laa.2017.02.018
  • Zhang L, Chang A. Spectral radius of r-uniform supertrees with perfect matchings. Frontiers Math China. 2018;13:1489–1499. doi: 10.1007/s11464-018-0737-5
  • Xiao P, Wang LG. The maximum spectral radius of uniform hypergraphs with given number of pendant edges. Linear Multilinear Algebra. 2019;67:1392–1403. doi: 10.1080/03081087.2018.1453471
  • Zhang JB, Li JP. The maximum spectral radius of k-uniform hypergraphs with r pendent vertices. Linear Multilinear Algebra. 2019;67:1062–1073. doi: 10.1080/03081087.2018.1442811
  • Su L, Kang LY, Li HH, et al. The largest spectral radius of uniform hypertrees with a given size of matching. Linear Multilinear Algebra. 2018. DOI: 10.1080/03081087.2018.1560389.
  • Guo HY, Zhou B. On the spectral radius of uniform hypertrees. Linear Algebra Appl. 2018;558:236–249. doi: 10.1016/j.laa.2018.07.035
  • Fan YZ, Tan YY, Peng XX, et al. Maximizing spectral radii of uniform hypergraphs wih few edges. Discussiones Mathematicae Graph Theor. 2016;36:845–856. doi: 10.7151/dmgt.1906
  • Lin HY, Zhou B. Spectral radius of uniform hypergraphs. Linear Algebra Appl. 2017;527:32–52. doi: 10.1016/j.laa.2017.04.005
  • Clark GJ, Cooper JN. On the adjacency spectra of hypertrees. Electron J Comb. 2018;25:P2.48. doi: 10.37236/7442
  • Khan MU, Fan YZ. On the spectral radius of a class of non-odd-bipartite even uniform hypergraphs. Linear Algebra Appl. 2015;480:93–106. doi: 10.1016/j.laa.2015.04.005
  • Zhang W, Kang LY, Shan EF, et al. The spectra of uniform hypertrees. Linear Algebra Appl. 2017;533:84–94. doi: 10.1016/j.laa.2017.07.018

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.