TY - JOUR
T1 - Products of digraphs and their competition graphs
AU - Sonntag, Martin
AU - Teichert, Hanns Martin
PY - 2016/1/1
Y1 - 2016/1/1
N2 - If D = (V,A) is a digraph, its competition graph (with loops) CGl(D) has the vertex set V and {u, v} ⊆ V is an edge of CGl(D) if and only if there is a vertex w ∈ V such that (u,w), (v,w) ∈ A. In CGl(D), loops {v} are allowed only if v is the only predecessor of a certain vertex w ∈ V. For several products D1 ο D2 of digraphs D1 and D2, we investigate the relations between the competition graphs of the factors D1, D2 and the competition graph of their product D1 ο D2.
AB - If D = (V,A) is a digraph, its competition graph (with loops) CGl(D) has the vertex set V and {u, v} ⊆ V is an edge of CGl(D) if and only if there is a vertex w ∈ V such that (u,w), (v,w) ∈ A. In CGl(D), loops {v} are allowed only if v is the only predecessor of a certain vertex w ∈ V. For several products D1 ο D2 of digraphs D1 and D2, we investigate the relations between the competition graphs of the factors D1, D2 and the competition graph of their product D1 ο D2.
UR - http://www.scopus.com/inward/record.url?scp=84953426206&partnerID=8YFLogxK
U2 - 10.7151/dmgt.1851
DO - 10.7151/dmgt.1851
M3 - Journal articles
AN - SCOPUS:84953426206
SN - 1234-3099
VL - 36
SP - 43
EP - 58
JO - Discussiones Mathematicae - Graph Theory
JF - Discussiones Mathematicae - Graph Theory
IS - 1
ER -