Cartesian products of directed graphs with loops
Combinatorics
2017-02-21 v1
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.
Keywords
Cite
@article{arxiv.1702.05946,
title = {Cartesian products of directed graphs with loops},
author = {Wilfried Imrich and Iztok Peterin},
journal= {arXiv preprint arXiv:1702.05946},
year = {2017}
}
Comments
12 pages, 1 figure