The extremal spectral radii of $$k$$k-uniform supertrees

  title={The extremal spectral radii of \$\$k\$\$k-uniform supertrees},
  author={Honghai Li and Jiayu Shao and Liqun Qi},
  journal={Journal of Combinatorial Optimization},
In this paper, we study some extremal problems of three kinds of spectral radii of $$k$$k-uniform hypergraphs (the adjacency spectral radius, the signless Laplacian spectral radius and the incidence $$Q$$Q-spectral radius). We call a connected and acyclic $$k$$k-uniform hypergraph a supertree. We introduce the operation of “moving edges” for hypergraphs, together with the two special cases of this operation: the edge-releasing operation and the total grafting operation. By studying the… 
On some properties of the $\alpha$-spectral radius of the $k$-uniform hypergraph
In this paper we show how the $\alpha$-spectral radius changes under the edge grafting operations on connected $k$-uniform hypergraphs. We characterize the extremal hypertree for $\alpha$-spectral
A bound on the spectral radius of hypergraphs with e edges
On the $\alpha$-spectral radius of uniform hypergraphs
For $0\le\alpha<1$ and a uniform hypergraph $G$, the $\alpha$-spectral radius of $G$ is the largest $H$-eigenvalue of $\alpha \mathcal{D}(G) +(1-\alpha)\mathcal{A}(G)$, where $\mathcal{D}(G)$ and
The Spectral Radii of Intersecting Uniform Hypergraphs
The celebrated Erdős–Ko–Rado theorem states that given $$n\geqslant 2k,$$ every intersecting k-uniform hypergraph G on n vertices has at most $$\left( {\begin{array}{c}n-1\\
Largest signless Laplacian spectral radius of uniform supertrees with diameter and pendent edges (vertices)
Let $$\mathbb{S}$$ S ( m, d, k ) be the set of k -uniform supertrees with m edges and diameter d , and S 1 ( m, d, k ) be the k -uniform supertree obtained from a loose path u 1 , e 1 , u 2 , e 2 ,
Some Spectral Properties of Uniform Hypergraphs
Some spectral characterizations of odd-bipartite hypergraphs are given, and a partial answer to a question posed by Shao et al (2014) is given.
The Matching Polynomials and Spectral Radii of Uniform Supertrees
The methods of grafting operations on supertrees and comparing matching polynomials are used to determine the first $\lfloor\frac{d}{2}\rfloor+1$ largest spectral radii of r-uniform superTrees with size $m$ and diameter $d$.
On the spectral radius of nonregular uniform hypergraphs
Let $G$ be a connected uniform hypergraphs with maximum degree $\Delta$, spectral radius $\lambda$ and minimum H-eigenvalue $\mu$. In this paper, we give some lower bounds for $\Delta-\lambda$, which
On the $\alpha$-spectral radius of the $k$-uniform supertrees
Let G be a k -uniform hypergraph with vertex set V ( G ) and edge set E ( G ). A connected and acyclic hypergraph is called a supertree. For 0 ≤ α < 1, the α -spectral radius of G is the largest H


Regular Uniform Hypergraphs, $s$-Cycles, $s$-Paths and Their largest Laplacian H-Eigenvalues
The Laplacian of a uniform hypergraph
The Laplacian is investigated, i.e., the normalized LaPLacian tensor of a k-uniform hypergraph, and it is shown that the real parts of all the eigenvalues of the LaPlacian are in the interval $$[0,2]$$, and the real part is zero if and only if the Eigenvalue is zero.
Some spectral properties and characterizations of connected odd-bipartite uniform hypergraphs
A -uniform hypergraph is called odd-bipartite, if is even and there exists some proper subset of such that each edge of contains odd number of vertices in . Odd-bipartite hypergraphs are
A general product of tensors with applications
  • J. Shao
  • Mathematics, Computer Science
  • 2012
H$^+$-Eigenvalues of Laplacian and Signless Laplacian Tensors
We propose a simple and natural definition for the Laplacian and the signless Laplacian tensors of a uniform hypergraph. We study their H$^+$-eigenvalues, i.e., H-eigenvalues with nonnegative
Spectra of Uniform Hypergraphs
H-Eigenvalues of signless Laplacian tensor for an even uniform hypergraph
The signless Laplacian tensor and its H-eigenvalues for an even uniform hypergraph are introduced in this paper. Some fundamental properties of them for an even uniform hypergraph are obtained. In