Chemical hypergraphs and their associated normalized Laplace operators are generalized and studied in the case where each vertex-hyperedge incidence has a real coefficient. We systematically study the effect of symmetries of a hypergraph on the spectrum of the Laplacian.</p
AbstractTo a regular hypergraph we attach an operator, called its adjacency matrix, and study the se...
In this paper we determine the full normalized Laplacian spectrum of the subdivision-vertex join, su...
We present a spectral theory of uniform hypergraphs that closely parallels Spectral Graph Theory. A ...
In this thesis, we bring forward the study of the spectral properties of graphs and we extend this t...
The spectral theory of the normalized Laplacian for chemical hypergraphs is further investigated. Th...
The graph Laplacian plays key roles in information processing of relational data, and has analogies ...
The celebrated Cheeger's Inequality (Alon and Milman 1985; Alon 1986) establishes a bound on the edg...
AbstractWe consider the normalized Laplace operator for directed graphs with positive and negative e...
Hypergraphs are a generalization of graphs in which edges can connect any number of vertices. They a...
The independence number, coloring number and related parameters are investigated in the setting of o...
A graph operator is a mapping F : Γ → Γ ′ , where Γ and ...
A complex unit hypergraph is a hypergraph where each vertex-edge incidence is given a complex unit l...
AbstractWe investigate how the spectrum of the normalized (geometric) graph Laplacian is affected by...
In this paper we determine the normalized Laplacian spectrum of the Q-vertex corona, Q-edge corona, ...
We present a spectral theory of uniform, regular and linear hypergraph. The main result are the natu...
AbstractTo a regular hypergraph we attach an operator, called its adjacency matrix, and study the se...
In this paper we determine the full normalized Laplacian spectrum of the subdivision-vertex join, su...
We present a spectral theory of uniform hypergraphs that closely parallels Spectral Graph Theory. A ...
In this thesis, we bring forward the study of the spectral properties of graphs and we extend this t...
The spectral theory of the normalized Laplacian for chemical hypergraphs is further investigated. Th...
The graph Laplacian plays key roles in information processing of relational data, and has analogies ...
The celebrated Cheeger's Inequality (Alon and Milman 1985; Alon 1986) establishes a bound on the edg...
AbstractWe consider the normalized Laplace operator for directed graphs with positive and negative e...
Hypergraphs are a generalization of graphs in which edges can connect any number of vertices. They a...
The independence number, coloring number and related parameters are investigated in the setting of o...
A graph operator is a mapping F : Γ → Γ ′ , where Γ and ...
A complex unit hypergraph is a hypergraph where each vertex-edge incidence is given a complex unit l...
AbstractWe investigate how the spectrum of the normalized (geometric) graph Laplacian is affected by...
In this paper we determine the normalized Laplacian spectrum of the Q-vertex corona, Q-edge corona, ...
We present a spectral theory of uniform, regular and linear hypergraph. The main result are the natu...
AbstractTo a regular hypergraph we attach an operator, called its adjacency matrix, and study the se...
In this paper we determine the full normalized Laplacian spectrum of the subdivision-vertex join, su...
We present a spectral theory of uniform hypergraphs that closely parallels Spectral Graph Theory. A ...
DOI
Add to ORKG