No label defined (Q4250155)
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 1303533
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1303533 |
Statements
10 November 1999
0 references
competition graphs
0 references
phylogeny graphs
0 references
digraph
0 references
0.858431875705719
0 references
0.8267803192138672
0 references
0.8170977234840393
0 references
The author gives a summary of the technical literature related to competition graphs and phylogeny graphs. Various motivations for these graphs are discussed and some open problems are also discussed. Suppose \((V,A)\) is a digraph. The associated competition graph is the graph \((V,E)\) with an edge between \(x\) and \(y\), for \(x\neq y\) in \(V\), if and only if there is a vertex \(a\) in \(V\) such that \((x,a)\) and \((y,a)\) are arcs in \(A\). The associated phylogeny graph is the graph \((V,F)\) with an edge between \(u\) and \(v\) for \(u\neq v\) in \(V\), if and only if there is a vertex \(a\) in \(V\) such that \((u,a)\) and \((v,a)\) are arcs in \(A\) or \((u,v)\) or \((v,u)\) is an arc in \(A\). For the entire collection see [Zbl 0910.00036].
0 references