A Harary-Sachs theorem for hypergraphs

DOI10.1016/j.jctb.2021.01.002zbMath1466.05146arXiv1812.00468OpenAlexW3118812648MaRDI QIDQ2033904

Gregory J. Clark, Joshua N. Cooper

Publication date: 18 June 2021

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.00468

zbMATH Keywords

hypergraphcharacteristic polynomialsubgraph statistics

Mathematics Subject Classification ID

Graph polynomials (05C31) Hypergraphs (05C65)

Related Items

Spectral moments of hypertrees and their applications ⋮ Applications of the Harary-Sachs theorem for hypergraphs ⋮ On a generalization of the spectral Mantel's theorem ⋮ Estrada index and subgraph centrality of hypergraphs via tensors ⋮ The characteristic polynomials of uniform double hyperstars and uniform hypertriangles ⋮ The trace and Estrada index of uniform hypergraphs with cut vertices ⋮ The high order spectrum of a graph and its applications in graph colouring and clique counting ⋮ Comparing the principal eigenvector of a hypergraph and its shadows ⋮ Algebraic and geometric multiplicities for some hypergraphs ⋮ On a relationship between the characteristic and matching polynomials of a uniform hypertree

Cites Work

• Unnamed Item
• Unnamed Item
• Spectra of uniform hypergraphs
• Analogue of the identity Log Det = Trace Log for resultants
• Eigenvalues of a real supersymmetric tensor
• Discriminants, resultants, and multidimensional determinants
• The Determinant of the Adjacency Matrix of a Graph
• Algebraic Graph Theory
• Some new trace formulas of tensors with applications in spectral hypergraph theory
• On Unicursal Paths in a Network of Degree 4