The effect on the adjacency and signless Laplacian spectral radii of uniform hypergraphs by grafting edges
From MaRDI portal
(Redirected from Publication:2228126)
Recommendations
- The effect on the (signless Laplacian) spectral radii of uniform hypergraphs by subdividing an edge
- The maximum spectral radius of uniform hypergraphs with given number of pendant edges
- The extremal spectral radii of k-uniform supertrees
- Distance (signless) Laplacian spectral radius of uniform hypergraphs
- The effect on the spectral radius of r-graphs by grafting or contracting edges
Cites work
- \(H^{+}\)-eigenvalues of Laplacian and signless Laplacian tensors
- A general product of tensors with applications
- An introduction to the theory of graph spectra
- Connected hypergraphs with small spectral radius
- Eigenvalues of a real supersymmetric tensor
- scientific article; zbMATH DE number 17788 (Why is no real title available?)
- scientific article; zbMATH DE number 1833074 (Why is no real title available?)
- On spectral hypergraph theory of the adjacency tensor
- On the principal eigenvectors of uniform hypergraphs
- On the spectral radius of graphs with cut edges
- Perron-Frobenius theorem for nonnegative multilinear forms and extensions
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- Some properties of the Laplace and normalized Laplace spectra of uniform hypergraphs
- Spectra of uniform hypergraphs
- Symmetric nonnegative tensors and copositive tensors
- The effect on the (signless Laplacian) spectral radii of uniform hypergraphs by subdividing an edge
- The eigenvectors associated with the zero eigenvalues of the Laplacian and signless Laplacian tensors of a uniform hypergraph
- The extremal spectral radii of k-uniform supertrees
- The first two largest spectral radii of uniform supertrees with given diameter
- The Laplacian spectral radii of trees with degree sequences
- The largest Laplacian and signless Laplacian \(H\)-eigenvalues of a uniform hypergraph
- The matching polynomials and spectral radii of uniform supertrees
- 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 spectral radius of trees on \(k\) pendant vertices
- Towards a spectral theory of graphs based on the signless Laplacian. I
Cited in
(3)
This page was built for publication: The effect on the adjacency and signless Laplacian spectral radii of uniform hypergraphs by grafting edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2228126)