Connected hypergraphs with small spectral radius
From MaRDI portal
Publication:314763
DOI10.1016/j.laa.2016.07.013zbMath1346.05171arXiv1402.5402OpenAlexW2963001570MaRDI QIDQ314763
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
Extremal problems in graph theory (05C35) Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)
Related Items (38)
The \(H\)-spectra of a class of generalized power hypergraphs ⋮ The first few unicyclic and bicyclic hypergraphs with largest spectral radii ⋮ Some properties of the p-spectral radius on tensors for general hypergraphs and their applications ⋮ A spectral method to incidence balance of oriented hypergraphs and induced signed hypergraphs ⋮ \((\alpha,\beta)\)-labelling method for \(k\)-uniform hypergraph and its applications ⋮ Spectra of weighted uniform hypertrees ⋮ On the principal eigenvectors of uniform hypergraphs ⋮ The α-normal labelling method for computing the p-spectral radii of uniform hypergraphs ⋮ The spectra of uniform hypertrees ⋮ The effect on the spectral radius of \(r\)-graphs by grafting or contracting edges ⋮ The linear unicyclic hypergraph with the second or third largest spectral radius ⋮ The first two largest spectral radii of uniform supertrees with given diameter ⋮ The trace and Estrada index of uniform hypergraphs with cut vertices ⋮ The effect on the (signless Laplacian) spectral radii of uniform hypergraphs by subdividing an edge ⋮ Comparing the principal eigenvector of a hypergraph and its shadows ⋮ The maximum spectral radius of uniform hypergraphs with given number of pendant edges ⋮ Spectral radius and matching number of the unicyclic hypergraph ⋮ The effect on the adjacency and signless Laplacian spectral radii of uniform hypergraphs by grafting edges ⋮ A reduction formula for the characteristic polynomial of hypergraph with pendant edges ⋮ The principal eigenvector to \(\alpha\)-spectral radius of hypergraphs ⋮ Bounds on the spectral radius of uniform hypergraphs ⋮ The stabilizing index and cyclic index of the coalescence and Cartesian product of uniform hypergraphs ⋮ Computing the \(p\)-spectral radii of uniform hypergraphs with applications ⋮ A bound on the spectral radius of hypergraphs with \(e\) edges ⋮ Some properties of the signless Laplacian and normalized Laplacian tensors of general hypergraphs ⋮ The matching polynomials and spectral radii of uniform supertrees ⋮ Eigenvectors of Laplacian or signless Laplacian of hypergraphs associated with zero eigenvalue ⋮ Ordering uniform supertrees by their spectral radii ⋮ The smallest spectral radius of bicyclic uniform hypergraphs with a given size ⋮ 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 second largest spectral radii of uniform hypertrees with given size of matching ⋮ Graphs whose \(A_\alpha \) -spectral radius does not exceed 2 ⋮ Uniform hypergraphs with the first two smallest spectral radii ⋮ Least H-eigenvalue of adjacency tensor of hypergraphs with cut vertices ⋮ Spectral radii of two kinds of uniform hypergraphs ⋮ The (signless Laplacian) spectral radius (of subgraphs) of uniform hypergraphs ⋮ On the spectral radius of a class of non-odd-bipartite even uniform hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Diameters of graphs with spectral radius at most \(\frac{3}{2}\sqrt{2}\)
- Spectra of uniform hypergraphs
- The minimal spectral radius of graphs with a given diameter
- The minimal spectral radius of graphs of order \(n\) with diameter \(n-4\)
- Perron-Frobenius theorem for nonnegative tensors
- Some notes on graphs whose spectral radius is close to \(\frac{3}{2}\sqrt 2\)
- Laplacian eigenvalues and partition problems in hypergraphs
- Asymptotic results on the spectral radius and the diameter of graphs
- On the distribution of the maximum eigenvalues of graphs
- The graphs with spectral radius between 2 and \(\sqrt{2+\sqrt{5}}\)
- Graphs with diameter \(n - e\) minimizing the spectral radius
- Analytic methods for uniform hypergraphs
- Eigenvalues of a real supersymmetric tensor
- Rank and eigenvalues of a supersymmetric tensor, the multivariate homogeneous polynomial and the algebraic hypersurface it defines
- On graphs whose spectral radius is bounded by \(\frac{3}{2}\sqrt{2}\)
- Loose laplacian spectra of random hypergraphs
- On the Laplacian Spectrum and Walk-regular Hypergraphs
- Spectral Extremal Problems for Hypergraphs
- High-Order Random Walks and Generalized Laplacians on Hypergraphs
This page was built for publication: Connected hypergraphs with small spectral radius
