On the Laplacian Eigenvalues and Metric Parameters of Hypergraphs

By J. Rodri´guez. 2002

91 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Geometry and Topology

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Anirban Banerjee
2. J. Rodríguez

In Geometry and Topology

1. Anirban Banerjee
2. J. Rodríguez

Citations in the corpus

• On the spectrum of hypergraphs (2017, methodology): “lacian matrices of two uniform hypergraphs and using it we can compute the eigenvalues of LQ(n,m). The definition of Laplacian matrix for a uniform hypergraph is similar, but not the same as defined in [38, 39, 40] for studying spectral properties of uniform hypergraphs. In [38], Rodr´ıguez studied th”
• On the Laplacian Spectrum and Walk-regular Hypergraphs (2003, background): “In [16] we showed that if the Laplacian matrix of a hypergraph H has b + 1 different eigenvalues then D(H) ≤ b.”