Article ID Journal Published Year Pages File Type
8903012 Discrete Mathematics 2018 8 Pages PDF
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
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
Cartesian products of directed graphs with loops
Authors
, ,