Journal article icon

Journal article

Applications of the Harary-Sachs theorem for hypergraphs

Abstract:

The Harary-Sachs theorem for k-uniform hypergraphs equates the codegreed coefficient of the adjacency characteristic polynomial of a uniform hypergraph with a weighted sum of subgraph counts over certain multi-hypergraphs with d edges. We begin by showing that the classical Harary-Sachs theorem for graphs is indeed a special case of this general theorem. To this end we apply the generalized Harary-Sachs theorem to the leading coefficients of the characteristic polynomial of various hypergraph...

Expand abstract
Publication status:
Accepted
Peer review status:
Peer reviewed

Actions


Authors


More by this author
Institution:
University of Oxford
Division:
SSD
Department:
Saïd Business School
Role:
Author
Publisher:
Elsevier Publisher's website
Journal:
Linear Algebra and Its Applications Journal website
Acceptance date:
2022-05-20
ISSN:
0024-3795
Language:
English
Keywords:
Pubs id:
1260406
Local pid:
pubs:1260406
Deposit date:
2022-05-23

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP