No label defined (Q4393363)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1161365
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1161365 |
Statements
5 January 1999
0 references
competition graph
0 references
enemy graph
0 references
digraph
0 references
CCE-graph
0 references
characterization
0 references
CCE-orientable graphs
0 references
0.8335250020027161
0 references
0.8041181564331055
0 references
0.766334593296051
0 references
0.7635682225227356
0 references
In the literature the notions of competition graph and of competition-common enemy graph (CCE-graph) of a digraph were defined. Necessary and sufficient conditions for a graph to be a CCE-graph were also given. Here the authors find a better (more practical) characterization of CCE-graphs and give several classes of graphs which are CCE-graphs. More precisely, the authors define CCE-orientable graphs, prove that any CCE-orientable graph is a CCE-graph, and find several families of graphs that are CCE-orientable graphs. The authors say that these graphs have applications in ecology and some other disciplines, but they do not give any application.
0 references
