Ordering uniform supertrees by their spectral radii

DOI10.1007/S11464-017-0636-1MaRDI QIDQ721464zbMATH OpenOpenAlexFDO

Authors Xiying Yuan, Xuelian Si, Li Zhang

Publication date 19 July 2018

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

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

zbMATH Keywords

adjacency tensorspectral radiusuniform hypergraphuniform supertree

Mathematics Subject Classification ID

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

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.

Review text

The authors extend previous results on ordering uniform supertrees on a given number of vertices by spectral radii from \textit{H. Li} et al. [J. Comb. Optim. 32, No. 3, 741--764 (2016; Zbl 1378.90084)] and \textit{X. Yuan} et al. [Linear Algebra Appl. 495, 206--222 (2016; Zbl 1331.05164)] to determine the ninth and the tenth supertree in such order.

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

Cites work

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

Cited in

(20)

• Spectral radius of r-uniform supertrees with perfect matchings
• The matching polynomials and spectral radii of uniform supertrees
• Largest signless Laplacian spectral radius of uniform supertrees with diameter and pendent edges (vertices)
• Uniform supertrees with extremal spectral radii
• On extremal spectral radii of uniform supertrees with given independence number
• On some properties of the \(\alpha \)-spectral radius of the \(k\)-uniform hypergraph
• The maximum spectral radii of uniform supertrees with given degree sequences
• The first two largest spectral radii of uniform supertrees with given diameter
• The linear unicyclic hypergraph with the second or third largest spectral radius
• The maximum \(\alpha\)-spectral radius of unicyclic hypergraphs with fixed diameter
• The extremal spectral radii of k-uniform supertrees
• On the spectral radii of k-uniform linear hypergraphs
• The extremal spectral radius of the mixed bi-uniform supertrees.
• The minimum spectral radius of the \(r\)-uniform supertree having two vertices of maximum degree
• The α-normal labelling method for computing the p-spectral radii of uniform hypergraphs
• Z-spectral radius of the adjacency tensor of uniform supertrees
• The maximum spectral radius of uniform hypergraphs with given number of pendant edges
• Ordering of some uniform supertrees with larger spectral radii
• On the -spectral radius of the k-uniform supertrees
• Largest \(H\)-eigenvalue of uniform \(s\)-hypertrees

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)