Ordering uniform supertrees by their spectral radii

DOI10.1007/S11464-017-0636-1zbMATH Open1395.15014arXiv1502.06474OpenAlexW1669183968MaRDI QIDQ721464FDOQ721464

Authors: Xiying Yuan, Xuelian Si, Li Zhang 

Publication date: 19 July 2018

Published in: Frontiers of Mathematics in China (Search for Journal in Brave)

Abstract: A connected and acyclic hypergraph is called a supertree. In this paper we mainly focus on the spectral radii of uniform supertrees. Li, Shao and Qi determined the first two $k$-uniform supertrees with large spectral radii among all the $k$-uniform supertrees on $n$ vertices [H. Li, J. Shao, L. Qi, The extremal spectral radii of $k$-uniform supertrees, arXiv:1405.7257v1, May 2014]. By applying the operation of moving edges on hypergraphs and using the weighted incidence matrix method we extend the above order to the fourth $k$-uniform supertree.

Full work available at URL: https://arxiv.org/abs/1502.06474

Recommendations

• Ordering of some uniform supertrees with larger spectral radii
• Uniform supertrees with extremal spectral radii
• The maximum spectral radii of uniform supertrees with given degree sequences
• The first two largest spectral radii of uniform supertrees with given diameter
• The matching polynomials and spectral radii of uniform supertrees

zbMATH Keywords

spectral radiusadjacency tensoruniform hypergraphuniform supertree

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Inequalities involving eigenvalues and eigenvectors (15A42)

Cites Work

• Eigenvalues of a real supersymmetric tensor
• Perron-Frobenius theorem for nonnegative multilinear forms and extensions
• Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues
• Connected hypergraphs with small spectral radius
• Spectra of uniform hypergraphs
• Perron-Frobenius theorem for nonnegative tensors
• Some spectral properties of uniform hypergraphs
• The extremal spectral radii of \(k\)-uniform supertrees
• Ordering of some uniform supertrees with larger spectral radii
• Ordering trees by their largest eigenvalues
• On the two largest eigenvalues of trees

Cited In (9)

• Spectral radius of \(r\)-uniform supertrees with perfect matchings
• The maximum spectral radii of uniform supertrees with given degree sequences
• On some properties of the \(\alpha \)-spectral radius of the \(k\)-uniform hypergraph
• The linear unicyclic hypergraph with the second or third largest spectral radius
• The maximum spectral radius of uniform hypergraphs with given number of pendant edges
• The α-normal labelling method for computing the p-spectral radii of uniform hypergraphs
• The first two largest spectral radii of uniform supertrees with given diameter
• The maximum \(\alpha\)-spectral radius of unicyclic hypergraphs with fixed diameter
• On extremal spectral radii of uniform supertrees with given independence number

This page was built for publication: Ordering uniform supertrees by their spectral radii

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q721464)