Cartesian products of directed graphs with loops
classification
🧮 math.CO
keywords
cartesiangraphsdirectedfiniteloopscomputedconnectedevery
read the original abstract
We show that every nontrivial finite or infinite connected directed graph with loops and at least one vertex without a loop is uniquely representable as a Cartesian or weak Cartesian product of prime graphs. For finite graphs the factorization can be computed in linear time and space.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.