On Spectral Hypergraph Theory of the Adjacency Tensor

We study both H and E / Z -eigenvalues of the adjacency tensor of a uniform multi-hypergraph and give conditions for which the largest positive H or Z -eigenvalue corresponds to a strictly positive eigenvector. We also investigate when the E -spectrum of the adjacency tensor is symmetric.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Graphs and combinatorics Jg. 30; H. 5; S. 1233 - 1248
Hauptverfasser: Pearson, Kelly J., Zhang, Tan
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Tokyo Springer Japan 01.09.2014
Springer Nature B.V
Schlagworte:
Combinatorial analysis
Combinatorics
Eigenvectors
Engineering Design
Graph theory
Graphs
Mathematical analysis
Mathematics
Mathematics and Statistics
Original Paper
Spectra
Tensors
Hypergraph
05C65
Spectral theory of hypergraph
05C50
Adjacency tensor
15A69
15A18
ISSN:0911-0119, 1435-5914
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We study both H and E / Z -eigenvalues of the adjacency tensor of a uniform multi-hypergraph and give conditions for which the largest positive H or Z -eigenvalue corresponds to a strictly positive eigenvector. We also investigate when the E -spectrum of the adjacency tensor is symmetric.
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:0911-0119
1435-5914
DOI:10.1007/s00373-013-1340-x