scientific article; zbMATH DE number 1303533
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].
- The competition-common enemy graph of a digraph
- Competition hypergraphs
- A matrix sequence \(\{\Gamma (A^m)\}^\infty_{m=1}\) might converge even if the matrix \(A\) is not primitive
- Competition numbers and phylogeny numbers: uniform complete multipartite graphs
- On \(m\)-step competition graphs of bipartite tournaments
- Developmental graphs comparison strategy for analysis of pattern formation and phylogeny
- On the phylogeny graphs of degree-bounded digraphs
- The m-step competition graphs of doubly partial orders
- On the matrix sequence \(\{\Gamma(A^m)\}_{m=1}^\infty\) for a Boolean matrix \(A\) whose digraph is linearly connected
- The competition hypergraphs of doubly partial orders
- A class of acyclic digraphs with interval competition graphs
- The elimination procedure for the competition number is not optimal
- scientific article; zbMATH DE number 1113981 (Why is no real title available?)
- On the radius of neighborhood graphs
- Graphs having many holes but with small competition numbers
- Note on competition and phylogeny numbers
- Competition hypergraphs of products of digraphs
- On CCE graphs of doubly partial orders
- Products of digraphs and their competition graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4250155)