The double competition multigraph of a digraph

In this article, we introduce the notion of the double competition multigraph of a digraph. We give characterizations of the double competition multigraphs of arbitrary digraphs, loopless digraphs, reflexive digraphs, and acyclic digraphs in terms of edge clique partitions of the multigraphs.

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Discrete mathematics and theoretical computer science 2015-12, Vol.17 no.2 (Graph Theory), p.303-310
Hauptverfasser:	Sano, Yoshio, Park, Jeongmi
Format:	Artikel
Sprache:	eng
Schlagworte:	[info.info-dm] computer science [cs]/discrete mathematics [cs.dm] competition graph competition multigraph competition-common enemy graph Computer Science Discrete Mathematics double competition multigraph edge clique partition Graphs Mathematics
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	In this article, we introduce the notion of the double competition multigraph of a digraph. We give characterizations of the double competition multigraphs of arbitrary digraphs, loopless digraphs, reflexive digraphs, and acyclic digraphs in terms of edge clique partitions of the multigraphs.
ISSN:	1365-8050 1462-7264 1365-8050
DOI:	10.46298/dmtcs.2133