Characteristic adjacency matrix associated with a hypergraph
arXiv:2608.18747
Abstract
We define a new matrix associated with a hypergraph. A study of this matrix is carried out, in particular the study of its spectrum, which shows the relevance of the construction. We demon- strate that this adjacency matrix is characterisitic of the hypergraph, that is to say, two isomorphic hypergraphs have similar matrices. Furthermore, starting from this matrix, we can reconstruct the hypergraph. Starting from this matrix, we introduce new graphs associated with the hypergraph.