The double competition multigraph of a digraph - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2015

The double competition multigraph of a digraph

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.
Fichier principal
Vignette du fichier
2489-9844-1-PB.pdf (209.45 Ko) Télécharger le fichier
Origin : Explicit agreement for this submission
Loading...

Dates and versions

hal-01349048 , version 1 (26-07-2016)

Identifiers

Cite

Yoshio Sano, Jeongmi Park. The double competition multigraph of a digraph. Discrete Mathematics and Theoretical Computer Science, 2015, Vol. 17 no.2 (2), pp.303-310. ⟨10.46298/dmtcs.2133⟩. ⟨hal-01349048⟩

Collections

TDS-MACS
25 View
890 Download

Altmetric

Share

Gmail Facebook X LinkedIn More