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 digraph

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.

Volume: Vol. 17 no.2
Section: Graph Theory
Published on: December 31, 2015
Submitted on: July 21, 2013
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]

Linked publications - datasets - softwares

Source : ScholeXplorer IsRelatedTo DOI 10.1016/0166-218x(87)90030-8
  • 10.1016/0166-218x(87)90030-8
The competition-common enemy graph of a digraph

Consultation statistics

This page has been seen 269 times.
This article's PDF has been downloaded 451 times.