The double competition multigraph of a digraph
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.
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2015-12-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/2133/pdf |
| _version_ | 1797270051482501120 |
|---|---|
| author | Yoshio Sano Jeongmi Park |
| author_facet | Yoshio Sano Jeongmi Park |
| author_sort | Yoshio Sano |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-25T01:58:07Z |
| format | Article |
| id | doaj.art-0b2d764b8051467aacc8f900bd8f5645 |
| institution | Directory Open Access Journal |
| issn | 1365-8050 |
| language | English |
| last_indexed | 2024-04-25T01:58:07Z |
| publishDate | 2015-12-01 |
| publisher | Discrete Mathematics & Theoretical Computer Science |
| record_format | Article |
| series | Discrete Mathematics & Theoretical Computer Science |
| spelling | doaj.art-0b2d764b8051467aacc8f900bd8f56452024-03-07T15:28:21ZengDiscrete Mathematics & Theoretical Computer ScienceDiscrete Mathematics & Theoretical Computer Science1365-80502015-12-01Vol. 17 no.2Graph Theory10.46298/dmtcs.21332133The double competition multigraph of a digraphYoshio Sano0Jeongmi Park1Graduate School of Systems and Information Engineering [Tsukuba]Department of Mathematics, Pusan National UniversityIn 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://dmtcs.episciences.org/2133/pdfcompetition multigraphcompetition graphcompetition-common enemy graphdouble competition multigraphedge clique partition[info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| spellingShingle | Yoshio Sano Jeongmi Park The double competition multigraph of a digraph Discrete Mathematics & Theoretical Computer Science competition multigraph competition graph competition-common enemy graph double competition multigraph edge clique partition [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| title | The double competition multigraph of a digraph |
| title_full | The double competition multigraph of a digraph |
| title_fullStr | The double competition multigraph of a digraph |
| title_full_unstemmed | The double competition multigraph of a digraph |
| title_short | The double competition multigraph of a digraph |
| title_sort | double competition multigraph of a digraph |
| topic | competition multigraph competition graph competition-common enemy graph double competition multigraph edge clique partition [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| url | https://dmtcs.episciences.org/2133/pdf |
| work_keys_str_mv | AT yoshiosano thedoublecompetitionmultigraphofadigraph AT jeongmipark thedoublecompetitionmultigraphofadigraph AT yoshiosano doublecompetitionmultigraphofadigraph AT jeongmipark doublecompetitionmultigraphofadigraph |