The extremal spectral radii of k-uniform supertrees

DOI10.1007/S10878-015-9896-4zbMATH Open1378.90084arXiv1405.7257OpenAlexW2469070497MaRDI QIDQ326472FDOQ326472

Authors: Liqun Qi, Honghai Li, Jia-Yu Shao 

Publication date: 12 October 2016

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

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.

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

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

Cited In (68)

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

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)