The Cartesian product of graphs with loops

Autor:	Boiko, Tetiana, Cuno, Johannes, Imrich, Wilfried, Lehner, Florian, van de Woestijne, Christiaan E.
Rok vydání:	2014
Předmět:	Mathematics - Combinatorics 05C70 (Primary) 13A05 20M13 05C85 (Secondary)
Druh dokumentu:	Working Paper
Popis:	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 figure
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1411.6887 Zobrazit plný text záznamu View this record from Arxiv