The double competition multigraph of a digraph

Abstract

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.

Keywords

• competition multigraph
• competition graph
• competition-common enemy graph
• double competition multigraph
• edge clique partition
• [info.info-dm] computer science [cs]/discrete mathematics [cs.dm]