The Automorphism Group of a Product of Graphs


In a recent paper we showed that every connected graph can be written as a weak cartesian product of a family of indecomposable rooted graphs and that this decomposition is unique to within isomorphisms. Using this unique prime factorization theorem we prove that if a graph X can be written as a product of connected rooted graphs, which are pairwise… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics