\((i,j)\) competition graphs (Q1179189): Difference between revisions

The competition graph \(G\) of an acyclic digraph \(D\) has the same vertex- set as \(D\) and vertices \(x\) and \(y\) are joined in \(G\) if and only if \(xu\) and \(yu\) are arcs in \(D\) for some vertex \(u\). The authors consider acyclic digraphs \(D\) satisfying certain degree restrictions and characterize such digraphs whose competition graphs are interval graphs, among other things.