Cartesian products of directed graphs with loops

DOI10.1016/j.disc.2018.01.021zbMath1383.05271arXiv1702.05946OpenAlexW2626568980MaRDI QIDQ1709534

Iztok Peterin, Wilfried Imrich

Publication date: 5 April 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1702.05946

zbMATH Keywords

Cartesian productinfinite graphsprime graphsweak Cartesian productdirected graph with loops

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Infinite graphs (05C63) Graph operations (line graphs, products, etc.) (05C76)

Related Items (3)

Unnamed Item ⋮ On Cartesian products of signed graphs ⋮ Direct product of automorphism groups of digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Graph multiplication
• Recognizing Cartesian products in linear time
• A polynomial time algorithm for finding the prime factors of Cartesian- product graphs
• Directed Cartesian-product graphs have unique factorizations that can be computed in polynomial time
• Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time
• Über das schwache Kartesische Produkt von Graphen
• The Cartesian product of graphs with loops
• Weak cartesian product of graphs

This page was built for publication: Cartesian products of directed graphs with loops