Investigating the connectivity of hypergraphs via their spectra (Q2714391)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Investigating the connectivity of hypergraphs via their spectra |
scientific article; zbMATH DE number 1604317
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Investigating the connectivity of hypergraphs via their spectra |
scientific article; zbMATH DE number 1604317 |
Statements
13 June 2001
0 references
hypergraphs
0 references
clusters
0 references
Laplacian
0 references
eigenvectors
0 references
0 references
0.9239861
0 references
0 references
0 references
0 references
Investigating the connectivity of hypergraphs via their spectra (English)
0 references
Hungarian exposition of \textit{M. Bolla} [Discrete Math. 117, No.~1-3, 13-39 (1993; Zbl 0781.05036)], \textit{M. Bolla} and \textit{G. Tusnády} [Discrete Math. 128, No.~1-3, 1-20 (1994; Zbl 0796.05066)], and \textit{M. Bolla} [Relations between spectral and classification properties of multigraphs, Ph.D. thesis, Budapest, 1993]. Linear algebraic methods are applied for finding clusters in hypergraphs. The notion of Laplacian is generalized and various estimates of the spectrum are investigated. An algorithm for finding clusters is also presented.
0 references
