The Cartesian product of graphs with loops
Combinatorics
2014-11-26 v1
Abstract
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.
Keywords
Cite
@article{arxiv.1411.6887,
title = {The Cartesian product of graphs with loops},
author = {Tetiana Boiko and Johannes Cuno and Wilfried Imrich and Florian Lehner and Christiaan E. van de Woestijne},
journal= {arXiv preprint arXiv:1411.6887},
year = {2014}
}
Comments
8 pages, 1 figure