The effect on the adjacency and signless Laplacian spectral radii of uniform hypergraphs by grafting edges
From MaRDI portal
Publication:2228126
DOI10.1016/J.LAA.2020.10.011zbMATH Open1458.05125OpenAlexW3093206978MaRDI QIDQ2228126FDOQ2228126
Authors: Peng Xiao, Ligong Wang
Publication date: 16 February 2021
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2020.10.011
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
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Hypergraphs (05C65)
Cites Work
- Eigenvalues of a real supersymmetric tensor
- An introduction to the theory of graph spectra
- Perron-Frobenius theorem for nonnegative multilinear forms and extensions
- Connected hypergraphs with small spectral radius
- Spectra of uniform hypergraphs
- \(H^{+}\)-eigenvalues of Laplacian and signless Laplacian tensors
- The largest Laplacian and signless Laplacian \(H\)-eigenvalues of a uniform hypergraph
- On spectral hypergraph theory of the adjacency tensor
- The Laplacian spectral radii of trees with degree sequences
- The spectral radius of trees on \(k\) pendant vertices
- Towards a spectral theory of graphs based on the signless Laplacian. I
- Symmetric nonnegative tensors and copositive tensors
- A general product of tensors with applications
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- Title not available (Why is that?)
- 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
- On the principal eigenvectors of uniform hypergraphs
- On the spectral radius of graphs with cut edges
- Title not available (Why is that?)
- Some properties of the Laplace and normalized Laplace spectra of uniform hypergraphs
- The maximum spectral radii of uniform supertrees with given degree sequences
- The first two largest spectral radii of uniform supertrees with given diameter
- The maximum spectral radius of uniform hypergraphs with given number of pendant edges
- The matching polynomials and spectral radii of uniform supertrees
- The effect on the (signless Laplacian) spectral radii of uniform hypergraphs by subdividing an edge
Cited In (1)
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)