Yoshio Sano ; Jeongmi Park - The double competition multigraph of a digraph

dmtcs:2133 - Discrete Mathematics & Theoretical Computer Science, December 31, 2015, Vol. 17 no.2 - https://doi.org/10.46298/dmtcs.2133
The double competition multigraph of a digraphArticle

Authors: Yoshio Sano 1; Jeongmi Park 2

  • 1 Graduate School of Systems and Information Engineering [Tsukuba]
  • 2 Department of Mathematics, Pusan National University


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.

https://doi.org/10.46298/dmtcs.2133
Source: HAL:hal-01349048v1
Volume: Vol. 17 no.2
Section: Graph Theory
Published on: December 31, 2015
Imported on: July 21, 2013
Keywords: [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [en] competition graph, competition multigraph, competition-common enemy graph, double competition multigraph, edge clique partition

Share and export

Consultation statistics

This page has been seen 581 times.
This article's PDF has been downloaded 763 times.