Signless normalized Laplacian for hypergraphs
From MaRDI portal
Abstract: The spectral theory of the normalized Laplacian for chemical hypergraphs is further investigated. The signless normalized Laplacian is introduced and it is shown that its spectrum for classical hypergraphs coincides with the spectrum of the normalized Laplacian for bipartite chemical hypergraphs. Furthermore, the spectra of special families of hypergraphs are established.
Recommendations
- Normalized Laplace operators for hypergraphs with real coefficients
- The signless Laplacian matrix of hypergraphs
- Some properties of the Laplace and normalized Laplace spectra of uniform hypergraphs
- Some properties of the signless Laplacian and normalized Laplacian tensors of general hypergraphs
- scientific article; zbMATH DE number 5575533
Cites work
- A no-go theorem for one-layer feedforward networks
- An oriented hypergraphic approach to algebraic graph theory
- Determining the robustness of an interdependent network with a hypergraph model
- Every binary code can be realized by convex sets
- Fluctuations in stochastic interacting particle systems
- Hamilton Paths in Grid Graphs
- scientific article; zbMATH DE number 956414 (Why is no real title available?)
- scientific article; zbMATH DE number 3805607 (Why is no real title available?)
- scientific article; zbMATH DE number 964896 (Why is no real title available?)
- Hypergraph Laplace operators for chemical reaction networks
- Intersecting longest paths and longest cycles: a survey
- Minimal embedding dimensions of connected neural codes
- Obstructions to convexity in neural codes
- On the multiplicity of Laplacian eigenvalues and Fiedler partitions
- Rainbow perfect domination in lattice graphs
- Sharp bounds for the largest eigenvalue
- SIS epidemic propagation on hypergraphs
- Some exact results for the exclusion process
- Spectra of hyperstars
- Spectral theory of Laplace operators on oriented hypergraphs
- The neural ring: an algebraic tool for analyzing the intrinsic structure of neural codes
- What can topology tell us about the neural code?
- What makes a neural code convex?
Cited in
(8)- Coloring the normalized Laplacian for oriented hypergraphs
- Some properties of the signless Laplacian and normalized Laplacian tensors of general hypergraphs
- Hypergraph Laplace operators for chemical reaction networks
- The signless Laplacian matrix of hypergraphs
- Spectrum of signless 1-Laplacian on simplicial complexes
- Normalized Laplace operators for hypergraphs with real coefficients
- Graphs, Simplicial Complexes and Hypergraphs: Spectral Theory and Topology
- Coloring outside the lines: spectral bounds for generalized hypergraph colorings
This page was built for publication: Signless normalized Laplacian for hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5054045)
