4,264 research outputs found
The Cartesian product of graphs with loops
We extend the definition of the Cartesian product to graphs with loops and
show that the Sabidussi-Vizing unique factorization theorem for connected
finite simple graphs still holds in this context for all connected finite
graphs with at least one unlooped vertex. We also prove that this factorization
can be computed in O(m) time, where m is the number of edges of the given
graph.Comment: 8 pages, 1 figur
- …