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.

Bibliographic Details
Main Authors: Yoshio Sano, Jeongmi Park
Format: Article
Language:English
Published: Discrete Mathematics & Theoretical Computer Science 2015-12-01
Series:Discrete Mathematics & Theoretical Computer Science
Subjects:
Online Access:https://dmtcs.episciences.org/2133/pdf