The linear unicyclic hypergraph with the second or third largest spectral radius
From MaRDI portal
Publication:2663282
Abstract: The spectral radius of a uniform hypergraph is defined to be that of the adjacency tensor the hypergraph. It is known that the unique unicyclic hypergraph with the largest spectral radius is a nonlinear hypergraph, and the unique linear unicyclic hypergraph with the largest spectral radius is a power hypergraph. In this paper we determine the the unique linear unicyclic hypergraph with the second or third largest spectral radius, where the former hypergraph is a power hypergraph and the latter hypergraph is a non-power hypergraph.
Recommendations
Cites work
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 2052087 (Why is no real title available?)
- A bound on the spectral radius of hypergraphs with \(e\) edges
- Connected hypergraphs with small spectral radius
- Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues
- Eigenvalues of a real supersymmetric tensor
- Eigenvariety of nonnegative symmetric weakly irreducible tensors associated with spectral radius and its application to hypergraphs
- Further results for Perron-Frobenius theorem for nonnegative tensors
- Maximizing spectral radii of uniform hypergraphs with few edges
- On eigenvalue problems of real symmetric tensors
- On spectral hypergraph theory of the adjacency tensor
- On the spectral radii of unicyclic graphs with fixed matching number
- On the spectral radius of uniform hypertrees
- Ordering of some uniform supertrees with larger spectral radii
- Ordering uniform supertrees by their spectral radii
- Perron-Frobenius theorem for nonnegative multilinear forms and extensions
- Perron-Frobenius theorem for nonnegative tensors
- Some spectral properties of uniform hypergraphs
- Spectra of uniform hypergraphs
- Spectral radii of two kinds of uniform hypergraphs
- Spectral radius of r-uniform supertrees with perfect matchings
- Spectral radius of uniform hypergraphs and degree sequences
- The extremal spectral radii of k-uniform supertrees
- The first few unicyclic and bicyclic hypergraphs with largest spectral radii
- The first two largest spectral radii of uniform supertrees with given diameter
- The largest spectral radius of uniform hypertrees with a given size of matching
- The maximum spectral radii of uniform supertrees with given degree sequences
- The maximum spectral radius of uniform hypergraphs with given number of pendant edges
- The spectra of uniform hypertrees
- The spectral symmetry of weakly irreducible nonnegative tensors and connected hypergraphs
This page was built for publication: The linear unicyclic hypergraph with the second or third largest spectral radius
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2663282)