\((i,j)\) competition graphs (Q1179189): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 23:34, 4 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | \((i,j)\) competition graphs |
scientific article |
Statements
\((i,j)\) competition graphs (English)
0 references
26 June 1992
0 references
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.
0 references
acyclic digraphs
0 references
competition graphs
0 references
interval graphs
0 references
