The double competition multigraph of a digraph
classification
🧮 math.CO
cs.DM
keywords
digraphscompetitiondoubledigraphmultigraphmultigraphsacyclicarbitrary
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.