The Hopf Algebra of graph invariants

Abstract

We propose an algebraic study of the simple graph isomorphism problem. We define a Hopf algebra from an explicit realization of its elements as formal power series. We show that these series can be evaluated on graphs and count occurrences of subgraphs. We establish a criterion for the isomorphism test of two simple graphs by means of occurrence counting of subgraphs. This criterion is deduced from algebraic relations between elements of our algebra.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…