The competition-common enemy graph of a digraph (Q1086581)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The competition-common enemy graph of a digraph |
scientific article; zbMATH DE number 3985255
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The competition-common enemy graph of a digraph |
scientific article; zbMATH DE number 3985255 |
Statements
The competition-common enemy graph of a digraph (English)
0 references
1987
0 references
The competition graph of a digraph was first defined in 1968 by Cohen in the study of ecosystems. The competition graph essentially relates any two species which have a common prey. In this paper, a competition-common enemy graph of a digraph is defined and studied. As the term suggests, it relates two species which have a common prey and a common enemy. Results analogous to those found for competition graphs are obtained.
0 references
competition graph
0 references
digraph
0 references
competition-common enemy graph
0 references
