Cartesian products of directed graphs with loops
Copyright policy )Cartesian products of directed graphs with loops
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.
12 pages, 1 figure
- University of Leoben Austria
- University of Maribor Slovenia
infinite graphs, directed graph with loops, Graph operations (line graphs, products, etc.), Directed graphs (digraphs), tournaments, 05C25, 05C20, Infinite graphs, prime graphs, Cartesian product, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), weak Cartesian product
infinite graphs, directed graph with loops, Graph operations (line graphs, products, etc.), Directed graphs (digraphs), tournaments, 05C25, 05C20, Infinite graphs, prime graphs, Cartesian product, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO), weak Cartesian product
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).5 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!