The effect on the (signless Laplacian) spectral radii of uniform hypergraphs by subdividing an edge
From MaRDI portal
Publication:2192100
DOI10.1016/J.DAM.2020.01.041zbMath1442.05126OpenAlexW3005846316MaRDI QIDQ2192100
Publication date: 29 June 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.01.041
spectral radiusuniform hypergraphsignless Laplacian spectral radiusLaplacian spectral radiussubdivision of an edge
Related Items (2)
Bounds on the spectral radius of general hypergraphs in terms of clique number ⋮ The effect on the adjacency and signless Laplacian spectral radii of uniform hypergraphs by grafting edges
Cites Work
- Unnamed Item
- Connected hypergraphs with small spectral radius
- The extremal spectral radii of \(k\)-uniform supertrees
- Maximizing spectral radii of uniform hypergraphs with few edges
- Spectra of uniform hypergraphs
- \(H^{+}\)-eigenvalues of Laplacian and signless Laplacian tensors
- The largest Laplacian and signless Laplacian \(H\)-eigenvalues of a uniform hypergraph
- Graph spectra in computer science
- On spectral hypergraph theory of the adjacency tensor
- Perron-Frobenius theorem for nonnegative tensors
- The Laplacian spectral radius for unicyclic graphs with given independence number
- The Laplacian spectral radius of a graph under perturbation
- Bounds on the spectral radius of uniform hypergraphs
- Perron-Frobenius theorem for nonnegative multilinear forms and extensions
- The matching polynomials and spectral radii of uniform supertrees
- On the spectral radius of a class of non-odd-bipartite even uniform hypergraphs
- The first few unicyclic and bicyclic hypergraphs with largest spectral radii
- The maximum spectral radii of uniform supertrees with given degree sequences
- The first two largest spectral radii of uniform supertrees with given diameter
- A general product of tensors with applications
- The eigenvectors associated with the zero eigenvalues of the Laplacian and signless Laplacian tensors of a uniform hypergraph
- Eigenvalues of a real supersymmetric tensor
- Minimizing the Laplacian spectral radius of trees with given matching number
- Towards a spectral theory of graphs based on the signless Laplacian, I
This page was built for publication: The effect on the (signless Laplacian) spectral radii of uniform hypergraphs by subdividing an edge