If σ = is any permutation of the numbers from 1 to n, then one may define a permutation graph from σ in which there are n vertices v1, v2,..., vn, and in which there is an edge vivj for any two indices i and j for which i < j and σi > σj. That is, two indices i and jdetermine an edge in the permutation graph exactly when they determine an inversion in the permutation. Given a permutation σ, one may also determine a set of line segments si with endpoints and. The endpoints of these segments lie on the two parallel lines y = 0 and y = 1, and two segments have a non-empty intersection if and only if they correspond to an inversion in the permutation. Thus, the permutation graph of σ coincides with the intersection graph of the segments. For every two parallel lines, and every finite set of line segments with endpoints on both lines, the intersection graph of the segments is a permutation graph; in the case that the segment endpoints are all distinct, a permutation for which it is the permutation graph may be given by numbering the segments on one of the two lines in consecutive order, and reading off these numbers in the order that the segment endpoints appear on the other line. Permutation graphs have several other equivalent characterizations:
A graph G is a permutation graph if and only if G is a circle graph that admits an equator, i.e., an additional chord that intersects every other chord.
A graph G is a permutation graph if and only if both G and its complement are comparability graphs.
If a graph G is a permutation graph, so is its complement. A permutation that represents the complement of G may be obtained by reversing the permutation representingG.
Efficient algorithms
It is possible to test whether a given graph is a permutation graph, and if so construct a permutation representing it, in linear time. As a subclass of the perfect graphs, many problems that are NP-complete for arbitrary graphs may be solved efficiently for permutation graphs. For instance:
the largest clique in a permutation graph corresponds to the longest decreasing subsequence in the permutation defining the graph, so the clique problem may be solved in polynomial time for permutation graphs by using a longest decreasing subsequence algorithm.
likewise, an increasing subsequence in a permutation corresponds to an independent set of the same size in the corresponding permutation graph.
the treewidth and pathwidth of permutation graphs can be computed in polynomial time; these algorithms exploit the fact that the number of inclusion minimal vertex separators in a permutation graph is polynomial in the size of the graph.
Relation to other graph classes
Permutation graphs are a special case of circle graphs, comparability graphs, the complements of comparability graphs, and trapezoid graphs. The subclasses of the permutation graphs include the bipartite permutation graphs and the cographs.
