The double competition multigraph of a digraph
Combinatorics
2016-02-02 v2 Discrete Mathematics
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.
Cite
@article{arxiv.1307.5509,
title = {The double competition multigraph of a digraph},
author = {Jeongmi Park and Yoshio Sano},
journal= {arXiv preprint arXiv:1307.5509},
year = {2016}
}
Comments
9 pages