The double competition multigraph of a digraph
Jeongmi Park, Yoshio Sano
TL;DR
This paper introduces the concept of the double competition multigraph of a digraph and provides characterizations for various classes of digraphs using edge clique partitions.
Contribution
It defines the double competition multigraph and characterizes it for different types of digraphs, expanding understanding of their structural properties.
Findings
Characterization of double competition multigraphs for arbitrary digraphs
Characterization for loopless and reflexive digraphs
Characterization for acyclic digraphs
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · graph theory and CDMA systems · Graph theory and applications