Products of digraphs and their competition graphs

Martin Sonntag; Hanns Martin Teichert

doi:10.7151/dmgt.1851

Products of digraphs and their competition graphs

Martin Sonntag, Hanns Martin Teichert

Institute of Mathematics

TU Bergakademie

4 Citations (Scopus)

Abstract

If D = (V,A) is a digraph, its competition graph (with loops) CG^l(D) has the vertex set V and {u, v} ⊆ V is an edge of CG^l(D) if and only if there is a vertex w ∈ V such that (u,w), (v,w) ∈ A. In CG^l(D), loops {v} are allowed only if v is the only predecessor of a certain vertex w ∈ V. For several products D₁ ο D² of digraphs D₁ and D₂, we investigate the relations between the competition graphs of the factors D₁, D₂ and the competition graph of their product D₁ ο D₂.

Original language	English
Journal	Discussiones Mathematicae - Graph Theory
Volume	36
Issue number	1
Pages (from-to)	43-58
Number of pages	16
ISSN	1234-3099
DOIs	https://doi.org/10.7151/dmgt.1851
Publication status	Published - 01.01.2016

Access to Document

10.7151/dmgt.1851

Cite this

@article{fbca2e1d3bd1438dbdf44b927a5d1c63,

title = "Products of digraphs and their competition graphs",

abstract = "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.",

author = "Martin Sonntag and Teichert, \{Hanns Martin\}",

year = "2016",

month = jan,

day = "1",

doi = "10.7151/dmgt.1851",

language = "English",

volume = "36",

pages = "43--58",

journal = "Discussiones Mathematicae - Graph Theory",

issn = "1234-3099",

publisher = "University of Zielona Gora",

number = "1",

}

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 - https://www.scopus.com/pages/publications/84953426206

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 -

Products of digraphs and their competition graphs

Abstract

Access to Document

Other files and links

Fingerprint

Cite this