Strongly chordal graph

In the mathematical area of graph theory, an undirected graph $G$ is strongly chordal if it is a chordal graph and every cycle of even length (≥ 6) in $G$ has an odd chord, i.e., an edge that connects two vertices that are an odd distance (>1) apart from each other in the cycle.

Characterizations
Strongly chordal graphs have a forbidden subgraph characterization as the graphs that do not contain an induced cycle of length greater than three or an n-sun (n ≥ 3) as an induced subgraph. An n-sun is a chordal graph with 2n vertices, partitioned into two subsets U = {u1, u2,...} and W = {w1, w2,...}, such that each vertex wi in W has exactly two neighbors, ui and u(i + 1) mod n. An n-sun cannot be strongly chordal, because the cycle u1w1u2w2... has no odd chord.

Strongly chordal graphs may also be characterized as the graphs having a strong perfect elimination ordering, an ordering of the vertices such that the neighbors of any vertex that come later in the ordering form a clique and such that, for each i < j < k < l, if the ith vertex in the ordering is adjacent to the kth and the lth vertices, and the jth and kth vertices are adjacent, then the jth and lth vertices must also be adjacent.

A graph is strongly chordal if and only if every one of its induced subgraphs has a simple vertex, a vertex whose neighbors have neighborhoods that are linearly ordered by inclusion. Also, a graph is strongly chordal if and only if it is chordal and every cycle of length five or more has a 2-chord triangle, a triangle formed by two chords and an edge of the cycle.

A graph is strongly chordal if and only if each of its induced subgraphs is a dually chordal graph.

Strongly chordal graphs may also be characterized in terms of the number of complete subgraphs each edge participates in. Yet another characterization is given in.

Recognition
It is possible to determine whether a graph is strongly chordal in polynomial time, by repeatedly searching for and removing a simple vertex. If this process eliminates all vertices in the graph, the graph must be strongly chordal; otherwise, if this process finds a subgraph without any more simple vertices, the original graph cannot be strongly chordal. For a strongly chordal graph, the order in which the vertices are removed by this process is a strong perfect elimination ordering.

Alternative algorithms are now known that can determine whether a graph is strongly chordal and, if so, construct a strong perfect elimination ordering more efficiently, in time O(min(n2, (n + m) log n)) for a graph with n vertices and m edges.

Subclasses
An important subclass (based on phylogeny) is the class of $k$-leaf powers, the graphs formed from the leaves of a tree by connecting two leaves by an edge when their distance in the tree is at most $k$. A leaf power is a graph that is a $k$-leaf power for some $k$. Since powers of strongly chordal graphs are strongly chordal and trees are strongly chordal, it follows that leaf powers are strongly chordal. They form a proper subclass of strongly chordal graphs, which in turn includes the cluster graphs as the 2-leaf powers. Another important subclass of strongly chordal graphs are interval graphs. In it is shown that interval graphs and the larger class of rooted directed path graphs are leaf powers.

Algorithmic problems
Since strongly chordal graphs are both chordal graphs and dually chordal graphs, various NP-complete problems such as Independent Set, Clique, Coloring, Clique Cover, Dominating Set, and Steiner Tree can be solved efficiently for strongly chordal graphs. Graph isomorphism is isomorphism-complete for strongly chordal graphs. Hamiltonian Circuit remains NP-complete for strongly chordal split graphs.