A Harary-Sachs theorem for hypergraphs

DOI10.1016/J.JCTB.2021.01.002MaRDI QIDQ2033904zbMATH OpenOpenAlexFDO

Authors Gregory J. Clark, Joshua 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

characteristic polynomialhypergraphsubgraph statistics

Mathematics Subject Classification ID

Graph polynomials (05C31) Hypergraphs (05C65)

Abstract: We generalize the Harary-Sachs theorem to $k$-uniform hypergraphs: the codegree-$d$ coefficient of the characteristic polynomial of a uniform hypergraph $calH$ can be expressed as a weighted sum of subgraph counts over certain multi-hypergraphs with $d$ edges. We include a detailed description of the aforementioned multi-hypergraphs and a formula for their corresponding weights.

Recommendations

• Applications of the Harary-Sachs theorem for hypergraphs
• The properties of some coefficients of the characteristic and the Laplacian polynomial of a hypergraph
• Some properties of chromatic coefficients of linear uniform hypergraphs
• The characteristic polynomial of the complete 3-uniform hypergraph
• Rectifying a misbelief: Frank Harary's role in the discovery of the coefficient-theorem in chemical graph theory

Cites work

• Algebraic Graph Theory
• Analogue of the identity Log Det = Trace Log for resultants
• Discriminants, resultants, and multidimensional determinants
• Eigenvalues of a real supersymmetric tensor
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• scientific article; zbMATH DE number 3224340 (Why is no real title available?)
• On Unicursal Paths in a Network of Degree 4
• Some new trace formulas of tensors with applications in spectral hypergraph theory
• Spectra of uniform hypergraphs
• The Determinant of the Adjacency Matrix of a Graph

Cited in

(29)

• A broken-circuits-theorem for hypergraphs
• Rectifying a misbelief: Frank Harary's role in the discovery of the coefficient-theorem in chemical graph theory
• Applications of the Harary-Sachs theorem for hypergraphs
• A reduction formula for the characteristic polynomial of hypergraph with pendant edges
• The trace and Estrada index of uniform hypergraphs with cut vertices
• A hypergraph version of the Gallai-Edmonds Theorem
• Hall's theorem for hypergraphs
• A Multipartite Version of the Hajnal–Szemerédi Theorem for Graphs and Hypergraphs
• Spectral moments of hypertrees and their applications
• 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 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
• The zero eigenvalue of the Laplacian tensor of a uniform hypergraph
• Spectra of power hypergraphs and signed graphs via parity-closed walks
• The trace of uniform hypergraphs with application to Estrada index
• Uniform hypertrees with maximum nullity
• Largest and least H-eigenvalues of symmetric tensors and hypergraphs
• A reduction formula for the Laplacian characteristic polynomial of a uniform hypertree
• High-ordered spectral characterization of unicyclic graphs
• The characteristic polynomials of uniform hypercycles with length four
• High-order spectral characterizations of graphs
• The Laplacian spectral moments of uniform hypergraphs
• The spectral moments of hypertrees and unicyclic hypergraphs
• Spectral bounds for the independence number of graphs and even uniform hypergraphs
• The ordering of hypertrees and unicyclic hypergraphs by the traces of \(\mathcal{A} \alpha\)-tensor

This page was built for publication: A Harary-Sachs theorem for hypergraphs

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