A Harary-Sachs theorem for hypergraphs

  title={A Harary-Sachs theorem for hypergraphs},
  author={Gregory J. Clark and Joshua N. Cooper},
  journal={J. Comb. Theory, Ser. B},

Figures from this paper

Applications of the Harary-Sachs theorem for hypergraphs
The trace and Estrada index of uniform hypergraphs with cut vertices
Let H be an m-uniform hypergraph, and let A(H) be the adjacency tensor of H which can be viewed as a system of homogeneous polynomials of degree m − 1. Morozov and Shakirov generalized the traces of
High-ordered spectral characterizations of graphs
The spectrum of the k-power hypergraph of a graph G is called the k-ordered spectrum of G. If graphs G1 and G2 have same k-ordered spectrum for all positive integer k ≥ 2, G1 and G2 are said to be
Characteristic Power Series of Graph Limits
In this note, we show how to obtain a ``characteristic power series'' of graphons -- infinite limits of graphs -- as the limit of normalized reciprocal characteristic polynomials. This leads to a
On the Effect of Data Dimensionality on Eigenvector Centrality
It is shown how analyzing multi-relational data, via a hypermatrix associated to the aforementioned hypergraph, can lead to conclusions different from those when the data is projected down to its co-occurrence matrix.
Spectral moments of hypertrees and their applications
The formula for the spectral moment of graphs which is represented by the number of subgraphs is called the RNS spectral moment formula of graphs. In this paper, the research on the RNS spectral mo...


Spectra of Uniform Hypergraphs
Leading Coefficients and the Multiplicity of Known Roots
We show that a monic univariate polynomial over a field of characteristic zero, with $k$ distinct non-zero known roots, is determined by its $k$ proper leading coefficients by providing an explicit
Analogue of the identity Log Det = Trace Log for resultants
Some new trace formulas of tensors with applications in spectral hypergraph theory
We give some graph theoretical formulas for the trace of a tensor which do not involve the differential operators and auxiliary matrix. As applications of these trace formulas in the study of the
Algebraic Graph Theory
The Laplacian of a Graph and Cuts and Flows are compared to the Rank Polynomial.
Discriminants, Resultants, and Multidimensional Determinants
Preface.- Introduction.- General Discriminants and Resultants.- Projective Dual Varieties and General Discriminants.- The Cayley Method of Studying Discriminants.- Associated Varieties and General
Quasi-random graphs
A large equivalence class of graph properties is introduced, all of which are shared by so-called random graphs, and it is often relatively easy to verify that a particular family of graphs possesses some property in this class.
On determinants and eigenvalue theory of tensors
The On-Line Encyclopedia of Integer Sequences
  • N. Sloane
  • Computer Science
    Electron. J. Comb.
  • 1994
The On-Line Encyclopedia of Integer Sequences (or OEIS) is a database of some 130000 number sequences which serves as a dictionary, to tell the user what is known about a particular sequence and is widely used.
Eigenvalues of a real supersymmetric tensor
  • L. Qi
  • Mathematics
    J. Symb. Comput.
  • 2005