Connected hypergraphs with small spectral radius

DOI10.1016/J.LAA.2016.07.013MaRDI QIDQ314763zbMATH OpenOpenAlexFDO

Authors Linyuan Lu, Shoudong Man

Publication date 16 September 2016

Published in Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

spectral radiushypergraphs\(\alpha\)-normalSmith's theorem

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Abstract: In 1970 Smith classified all connected graphs with the spectral radius at most $2$. Here the spectral radius of a graph is the largest eigenvalue of its adjacency matrix. Recently, the definition of spectral radius has been extended to $r$-uniform hypergraphs. In this paper, we generalize the Smith's theorem to $r$-uniform hypergraphs. We show that the smallest limit point of the spectral radii of connected $r$-uniform hypergraphs is $h{o}_r=(r-1)!sqrt[r]4$. We discovered a novel method for computing the spectral radius of hypergraphs, and classified all connected $r$-uniform hypergraphs with spectral radius at most $h{o}_r$.

Recommendations

• scientific article; zbMATH DE number 3972892
• Bounds of the spectral radius of connected graphs
• Bounds of the spectral radius of connected graphs
• Spectral characterizations of graphs with small spectral radius
• Spectral radius of strongly connected digraphs
• On spectral radius of strongly connected digraphs
• On the spectral radius of graphs with connectivity at most \(k\)
• Connectivity and minimal distance spectral radius of graphs
• Spectral radius and \(k\)-connectedness of a graph
• On the spectra of connected graphs

Cites work

• scientific article; zbMATH DE number 3465473 (Why is no real title available?)
• scientific article; zbMATH DE number 3512165 (Why is no real title available?)
• scientific article; zbMATH DE number 475375 (Why is no real title available?)
• scientific article; zbMATH DE number 3794105 (Why is no real title available?)
• scientific article; zbMATH DE number 3394189 (Why is no real title available?)
• Analytic methods for uniform hypergraphs
• Asymptotic results on the spectral radius and the diameter of graphs
• Diameters of graphs with spectral radius at most \(\frac{3}{2}\sqrt{2}\)
• Eigenvalues of a real supersymmetric tensor
• Graphs with diameter \(n - e\) minimizing the spectral radius
• High-order random walks and generalized Laplacians on hypergraphs
• Laplacian eigenvalues and partition problems in hypergraphs
• Loose Laplacian spectra of random hypergraphs
• On graphs whose spectral radius is bounded by \(\frac{3}{2}\sqrt{2}\)
• On the Laplacian Spectrum and Walk-regular Hypergraphs
• On the distribution of the maximum eigenvalues of graphs
• Perron-Frobenius theorem for nonnegative tensors
• Rank and eigenvalues of a supersymmetric tensor, the multivariate homogeneous polynomial and the algebraic hypersurface it defines
• Some notes on graphs whose spectral radius is close to \(\frac{3}{2}\sqrt 2\)
• Spectra of uniform hypergraphs
• Spectral extremal problems for hypergraphs
• The graphs with spectral radius between 2 and \(\sqrt{2+\sqrt{5}}\)
• The minimal spectral radius of graphs of order \(n\) with diameter \(n-4\)
• The minimal spectral radius of graphs with a given diameter

Cited in

(45)

• Some properties of the signless Laplacian and normalized Laplacian tensors of general hypergraphs
• Spectra of weighted uniform hypertrees
• The second largest spectral radii of uniform hypertrees with given size of matching
• Eigenvectors of Laplacian or signless Laplacian of hypergraphs associated with zero eigenvalue
• Largest signless Laplacian spectral radius of uniform supertrees with diameter and pendent edges (vertices)
• The \(H\)-spectra of a class of generalized power hypergraphs
• The matching polynomials and spectral radii of uniform supertrees
• Spectral radii of two kinds of uniform hypergraphs
• A bound on the spectral radius of hypergraphs with \(e\) edges
• A reduction formula for the characteristic polynomial of hypergraph with pendant edges
• The principal eigenvector to \(\alpha\)-spectral radius of hypergraphs
• Graphs whose \(A_\alpha \) -spectral radius does not exceed 2
• Computing the \(p\)-spectral radii of uniform hypergraphs with applications
• The maximum spectral radius of the weighted bicyclic hypergraphs
• The stabilizing index and cyclic index of the coalescence and Cartesian product of uniform hypergraphs
• Comparing the principal eigenvector of a hypergraph and its shadows
• Ordering uniform supertrees by their spectral radii
• Hypergraphs with spectral radius between two limit points
• Some properties of the p-spectral radius on tensors for general hypergraphs and their applications
• \((\alpha,\beta)\)-labelling method for \(k\)-uniform hypergraph and its applications
• Spectral radius and matching number of the unicyclic hypergraph
• The smallest spectral radius of bicyclic uniform hypergraphs with a given size
• A spectral method to incidence balance of oriented hypergraphs and induced signed hypergraphs
• Infinite families of connected graphs with equal spectral radius
• Uniform hypergraphs with the first two smallest spectral radii
• Bounds on the spectral radius of uniform hypergraphs
• On the spectral radius of a class of non-odd-bipartite even uniform hypergraphs
• Hypergraphs with spectral radius at most \(\sqrt[r]{2+\sqrt{5}}\)
• The linear unicyclic hypergraph with the second or third largest spectral radius
• On the principal eigenvectors of uniform hypergraphs
• Spectral radius of \(\{0,1\}\)-tensor with prescribed number of ones
• The trace of uniform hypergraphs with application to Estrada index
• The spectra of uniform hypertrees
• The effect on the spectral radius of \(r\)-graphs by grafting or contracting edges
• Least H-eigenvalue of adjacency tensor of hypergraphs with cut vertices
• 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
• Mader's conjecture for graphs with small connectivity
• The first few unicyclic and bicyclic hypergraphs with largest spectral radii
• The trace and Estrada index of uniform hypergraphs with cut vertices
• The first two largest spectral radii of uniform supertrees with given diameter
• Extremal spectral radius of degree-based weighted adjacency matrices of graphs with given order and size
• The (signless Laplacian) spectral radius (of subgraphs) of uniform hypergraphs
• 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

This page was built for publication: Connected hypergraphs with small spectral radius

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