On the spectral radius of uniform weighted hypergraph
From MaRDI portal
Publication:6174148
Abstract: Let be the set of the connected -uniform weighted hypergraphs with vertices, where . For a hypergraph , let , and be its adjacency tensor, Laplacian tensor and signless Laplacian tensor, respectively. The spectral radii of and are investigated. Some basic properties of the -eigenvalue, the -eigenvalue and the -eigenvalue of , and are presented. Several lower and upper bounds of the -eigenvalue, the -eigenvalue and the -eigenvalue for , and are established. The largest -eigenvalue of and the smallest -eigenvalue of are characterized. A relationship among the -eigenvalues of , and is also given.
Recommendations
- Some upper bounds on the eigenvalues of uniform hypergraphs
- Sharp bounds for the signless Laplacian spectral radius of uniform hypergraphs
- Bounds on the spectral radius of uniform hypergraphs
- The weighted hypergraph with the maximum spectral radius
- Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees
Cites work
- Asymptotics for Turán numbers of cycles in 3-uniform linear hypergraphs
- Brualdi-type eigenvalue inclusion sets of tensors
- Computing all Laplacian H-eigenvalues for a uniform loose path of length three
- Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues
- Eigenvalues of a real supersymmetric tensor
- Finding all \(H\)-eigenvalues of signless Laplacian tensor for a uniform loose path of length three
- Further results for Perron-Frobenius theorem for nonnegative tensors
- H-eigenvalues of signless Laplacian tensor for an even uniform hypergraph
- Largest adjacency, signless Laplacian, and Laplacian H-eigenvalues of loose paths
- Maximizing spectral radii of uniform hypergraphs with few edges
- 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
- On the spectral radius of uniform hypertrees
- Ordering of some uniform supertrees with larger spectral radii
- Perron-Frobenius theorem for nonnegative multilinear forms and extensions
- Spectra of uniform hypergraphs
- Spectral extremal results for hypergraphs
- Spectral radii of two kinds of uniform hypergraphs
- Spectral radius of r-uniform supertrees with perfect matchings
- The \(Z\)-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory.
- The first few unicyclic and bicyclic hypergraphs with largest spectral radii
- The largest Laplacian and signless Laplacian \(H\)-eigenvalues of a uniform hypergraph
- 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 minimum spectral radius of the \(r\)-uniform supertree having two vertices of maximum degree
- The proof of a conjecture on largest Laplacian and signless Laplacian H-eigenvalues of uniform hypergraphs
- Uniform supertrees with extremal spectral radii
- \(H^{+}\)-eigenvalues of Laplacian and signless Laplacian tensors
Cited in
(10)- Spectra of weighted uniform hypertrees
- The clique and coclique numbers' bounds based on the H-eigenvalues of uniform hypergraphs
- Spectral radius of uniform hypergraphs
- Signed \(k\)-uniform hypergraphs and tensors
- Convergence analysis of the largest and smallest H-eigenvalues for a class of tensor sequences
- Two equivalent measures on weighted hypergraphs
- Spectral radius of uniform hypergraphs and degree sequences
- The weighted hypergraph with the maximum spectral radius
- Bounds on the spectral radius of uniform hypergraphs
- Spectral theory of weighted hypergraphs via tensors
This page was built for publication: On the spectral radius of uniform weighted hypergraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6174148)