Abstract

The graph Laplacian is useful to describe graphs in a matrical way and access thus to linear algebraic tools. Here, we show that this description can also serve for graph comparison, which can be done in many ways. Different possibilities are discussed and at last, we explore the extension of this work to hypergraph comparison. This is a joint work with Hiroshi Mamitsuka and Hao Canh Nguyen from Kyoto University.