Interval competition graphs of symmetric digraphs (Q688262): Difference between revisions

The authors study competition graphs introduced by \textit{A. Raychaudhuri} and \textit{F. S. Roberts} [Methods Oper. Res. 49, 295-311 (1985; Zbl 0572.05050)]. They show that, given a loopless symmetric digraph \(H\), its competition graph is the two-step graph \(S_ 2(H)\) where two vertices of \(H\) are adjacent provided there is a path of length two between them. Moreover they give necessary and sufficient conditions on \(H\) under which \(S_ 2(H)\) is an interval graph or a unit interval graph. Thus they answer a question posed by Raychaudhuri and Roberts (1985).