We present a spectral theory of uniform, regular and linear hypergraph. The main result are the nature of the eigenvalues of (k, r) - regular linear hypergraph and the relation between its dual and line graph. We also discuss some properties of Laplacian spectrum of a (k, r) - regular hypergraphs
In this thesis, we bring forward the study of the spectral properties of graphs and we extend this t...
Consider two graphs G and H. Let H^k[G] be the lexicographic product of H^k and G, where H^k is the ...
The matrix representations of hypergraphs have been defined via hypermatrices initially. In recent s...
AbstractTo a regular hypergraph we attach an operator, called its adjacency matrix, and study the se...
AbstractGraphs with (k,τ)-regular sets and equitable partitions are examples of graphs with regulari...
We present a spectral theory of uniform hypergraphs that closely parallels Spectral Graph Theory. A ...
This paper presents some analytic methods for studying uniform hypergraphs. Its starting point is th...
This paper presents some analytic methods for studying uniform hypergraphs. Its starting point is th...
Graphs with (k, τ)-regular sets and equitable partitions are examples of graphs with regularity cons...
AbstractWe present a spectral theory of uniform hypergraphs that closely parallels Spectral Graph Th...
AbstractA set of vertices S⊆V(G) is (k,τ)-regular if it induces a k-regular subgraph of G such that ...
Abstract In this paper, we investigate the Laplacian, i.e., the normalized Laplacian tensor of a k-u...
AbstractTo a regular hypergraph we attach an operator, called its adjacency matrix, and study the se...
The purpose of this paper is to introduce a model to study structures which are widely present in pu...
In this paper, we show that the largest signless Laplacian H-eigenvalue of a connected k-uniform hyp...
In this thesis, we bring forward the study of the spectral properties of graphs and we extend this t...
Consider two graphs G and H. Let H^k[G] be the lexicographic product of H^k and G, where H^k is the ...
The matrix representations of hypergraphs have been defined via hypermatrices initially. In recent s...
AbstractTo a regular hypergraph we attach an operator, called its adjacency matrix, and study the se...
AbstractGraphs with (k,τ)-regular sets and equitable partitions are examples of graphs with regulari...
We present a spectral theory of uniform hypergraphs that closely parallels Spectral Graph Theory. A ...
This paper presents some analytic methods for studying uniform hypergraphs. Its starting point is th...
This paper presents some analytic methods for studying uniform hypergraphs. Its starting point is th...
Graphs with (k, τ)-regular sets and equitable partitions are examples of graphs with regularity cons...
AbstractWe present a spectral theory of uniform hypergraphs that closely parallels Spectral Graph Th...
AbstractA set of vertices S⊆V(G) is (k,τ)-regular if it induces a k-regular subgraph of G such that ...
Abstract In this paper, we investigate the Laplacian, i.e., the normalized Laplacian tensor of a k-u...
AbstractTo a regular hypergraph we attach an operator, called its adjacency matrix, and study the se...
The purpose of this paper is to introduce a model to study structures which are widely present in pu...
In this paper, we show that the largest signless Laplacian H-eigenvalue of a connected k-uniform hyp...
In this thesis, we bring forward the study of the spectral properties of graphs and we extend this t...
Consider two graphs G and H. Let H^k[G] be the lexicographic product of H^k and G, where H^k is the ...
The matrix representations of hypergraphs have been defined via hypermatrices initially. In recent s...
DOI
Add to ORKG