The Spectra of Infinite Hypertrees

DOI10.1137/0220058MaRDI QIDQ3982715zbMATH OpenOpenAlexFDO

Authors Joel Friedman

Publication date 26 June 1992

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/eb0a2991bcb8f97ecad71da25fe10b350790e24f

zbMATH Keywords

first eigenvalueinfinite hypertreesrandom hypergraphsecond eigenvaluespectratree

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Hypergraphs (05C65) Random graphs (graph-theoretic aspects) (05C80) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The spectra of uniform hypertrees
• On the spectra of hypertrees
• Infinite spectra of first-order properties for random hypergraphs
• On the adjacency spectra of hypertrees
• The first two hypertrees with larger spectral radius among all uniform hypertrees with given size and strong stability number

Cited in

(10)

• Some geometric aspects of graphs and their eigenfunctions
• On the adjacency spectra of hypertrees
• The spectra of uniform hypertrees
• On the spectra of hypertrees
• Expander graphs and their applications
• On the first and second eigenvalue of finite and infinite uniform hypergraphs
• Tensors in computations
• Spectral moments of hypertrees and their applications
• A hypergraph Heilmann-Lieb theorem
• Bisection width, discrepancy, and eigenvalues of hypergraphs

This page was built for publication: The Spectra of Infinite Hypertrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3982715)