The extremal spectral radii of k-uniform supertrees

DOI10.1007/S10878-015-9896-4MaRDI QIDQ326472zbMATH OpenOpenAlexFDO

Authors Liqun Qi, Honghai Li, Jia-Yu Shao

Publication date 12 October 2016

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

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

zbMATH Keywords

spectral radiusadjacency tensorhypergraphsignless Laplacian tensorsupertreeincidence \(Q\)-tensor

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Abstract: In this paper, we study some extremal problems of three kinds of spectral radii of $k$-uniform hypergraphs (the adjacency spectral radius, the signless Laplacian spectral radius and the incidence $Q$-spectral radius). We call a connected and acyclic $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 perturbation of these kinds of spectral radii of hypergraphs under these operations, we prove that for all these three kinds of spectral radii, the hyperstar $mathcal{S}_{n,k}$ attains uniquely the maximum spectral radius among all $k$-uniform supertrees on $n$ vertices. We also determine the unique $k$-uniform supertree on $n$ vertices with the second largest spectral radius (for these three kinds of spectral radii). We also prove that for all these three kinds of spectral radii, the loose path $mathcal{P}_{n,k}$ attains uniquely the minimum spectral radius among all $k$-th power hypertrees of $n$ vertices. Some bounds on the incidence $Q$-spectral radius are given. The relation between the incidence $Q$-spectral radius and the spectral radius of the matrix product of the incidence matrix and its transpose is discussed.

Recommendations

• On the spectral radii of \(k\)-uniform linear hypergraphs
• Ordering of some uniform supertrees with larger spectral radii
• Ordering uniform supertrees by their spectral radii
• Uniform supertrees with extremal spectral radii
• Spectral radius of \(r\)-uniform supertrees with perfect matchings

Cites work

• scientific article; zbMATH DE number 193053 (Why is no real title available?)
• scientific article; zbMATH DE number 3606484 (Why is no real title available?)
• A general product of tensors with applications
• A survey on the spectral theory of nonnegative tensors.
• Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues
• Eigenvalues of a real supersymmetric tensor
• H-eigenvalues of signless Laplacian tensor for an even uniform hypergraph
• Hypergraph theory. An introduction
• On spectral hypergraph theory of the adjacency tensor
• On the Z-eigenvalues of the adjacency tensors for uniform hypergraphs
• On the Z-eigenvalues of the signless Laplacian tensor for an even uniform hypergraph
• Perron-Frobenius theorem for nonnegative multilinear forms and extensions
• Regular uniform hypergraphs, \(s\)-cycles, \(s\)-paths and their largest Laplacian H-eigenvalues
• Spectra of uniform hypergraphs
• The Laplacian of a uniform hypergraph
• The eigenvectors associated with the zero eigenvalues of the Laplacian and signless Laplacian tensors of a uniform hypergraph
• The inverse, rank and product of tensors
• The largest Laplacian and signless Laplacian \(H\)-eigenvalues of a uniform hypergraph
• \(H^{+}\)-eigenvalues of Laplacian and signless Laplacian tensors

Cited in

(68)

• Sharp bounds on the spectral radii of uniform hypergraphs concerning diameter or clique number
• The second largest spectral radii of uniform hypertrees with given size of matching
• Hypergraph analysis based on a compatible tensor product structure
• The linear unicyclic hypergraph with the second or third largest spectral radius
• Pareto H-eigenvalues of nonnegative tensors and uniform hypergraphs
• The maximum spectral radius of the weighted bicyclic hypergraphs
• The trace of uniform hypergraphs with application to Estrada index
• The hypertree with the largest spectral radius among all hypertrees with given size and stability number
• On the spectral radii of \(k\)-uniform linear hypergraphs
• The trace and Estrada index of uniform hypergraphs with cut vertices
• On spectral theory of a k-uniform directed hypergraph
• Extremality of graph entropy based on degrees of uniform hypergraphs with few edges
• The spectral radii of intersecting uniform hypergraphs
• The effect on the adjacency and signless Laplacian spectral radii of uniform hypergraphs by grafting edges
• Principal eigenvectors and spectral radii of uniform hypergraphs
• On extremal spectral radii of uniform supertrees with given independence number
• Spectral radius of \(r\)-uniform supertrees with perfect matchings
• Some properties on \(\alpha\)-least eigenvalue of uniform hypergraphs and their applications
• The \(\alpha\)-normal labeling for generalized directed uniform hypergraphs
• Least H-eigenvalue of adjacency tensor of hypergraphs with cut vertices
• Inverse Perron values and connectivity of a uniform hypergraph
• Uniform supertrees with extremal spectral radii
• The matching polynomials and spectral radii of uniform supertrees
• The extremal spectral radius of the mixed bi-uniform supertrees.
• Some bounds for the incidence \(Q\)-spectral radius of uniform hypergraphs
• On the \(\alpha \)-spectral radius of uniform hypergraphs
• The smallest spectral radius of bicyclic uniform hypergraphs with a given size
• On the conjecture of the \(r\)-uniform supertrees with the eight largest \(\alpha\)-spectral radii
• Some properties of the signless Laplacian and normalized Laplacian tensors of general hypergraphs
• The maximum \(\alpha \)-spectral radius and the majorization theorem of \(k\)-uniform supertrees
• The weighted hypergraph with the maximum spectral radius
• Maximizing spectral radii of uniform hypergraphs with few edges
• The minimum spectral radius of the \(r\)-uniform supertree having two vertices of maximum degree
• Some spectral properties of uniform hypergraphs
• Spectral properties of general hypergraphs
• The \(\alpha \)-spectral radius of general hypergraphs
• Ordering of some uniform supertrees with larger spectral radii
• The first few unicyclic and bicyclic hypergraphs with largest spectral radii
• Extremal problems for the \(p\)-spectral radius of Berge hypergraphs
• Some properties of the p-spectral radius on tensors for general hypergraphs and their applications
• The maximum spectral radii of uniform supertrees with given degree sequences
• Some properties of the Laplace and normalized Laplace spectra of uniform hypergraphs
• On some properties of the \(\alpha \)-spectral radius of the \(k\)-uniform hypergraph
• On the second largest distance eigenvalue of a block graph
• Ordering uniform supertrees by their spectral radii
• Spectral radius of uniform hypergraphs and degree sequences
• Largest \(H\)-eigenvalue of uniform \(s\)-hypertrees
• The effect on the spectral radius of \(r\)-graphs by grafting or contracting edges
• The effect on the (signless Laplacian) spectral radii of uniform hypergraphs by subdividing an edge
• The maximum \(\alpha\)-spectral radius of unicyclic hypergraphs with fixed diameter
• The α-normal labelling method for computing the p-spectral radii of uniform hypergraphs
• Spectral radius and matching number of the unicyclic hypergraph
• Computing the \(p\)-spectral radii of uniform hypergraphs with applications
• The spectra of uniform hypertrees
• The maximum spectral radius of uniform hypergraphs with given number of pendant edges
• Uniform hypergraphs with the first two smallest spectral radii
• Hypergraph characterizations of copositive tensors
• On the principal eigenvectors of uniform hypergraphs
• On the spectral radius of uniform hypertrees
• Spectral radius of \(\{0,1\}\)-tensor with prescribed number of ones
• Largest signless Laplacian spectral radius of uniform supertrees with diameter and pendent edges (vertices)
• The least H-eigenvalue of signless Laplacian of non-odd-bipartite hypergraphs
• A bound on the spectral radius of hypergraphs with \(e\) edges
• The extremal \(p\)-spectral radius of Berge hypergraphs
• The largest spectral radius of uniform hypertrees with a given size of matching
• The first two largest spectral radii of uniform supertrees with given diameter
• The (signless Laplacian) spectral radius (of subgraphs) of uniform hypergraphs
• On the irregularity of uniform hypergraphs

This page was built for publication: The extremal spectral radii of \(k\)-uniform supertrees

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