Chordal Graph

Chordal Graph

In the mathematical area of graph theory, a graph is chordal if each of its cycles of four or more nodes has a chord, which is an edge joining two nodes that are not adjacent in the cycle.

An equivalent definition is that any chordless cycle has at most three nodes. In other words, a chordal graph is a graph with no induced cycles of length more than three.

Chordal graphs are a subset of perfect graphs. They are sometimes also called rigid circuit graphs or triangulated graphs. (The latter term is sometimes erroneously used for plane triangulations; see maximal planar graphs.)

Read more about Chordal Graph:  Perfect Elimination and Efficient Recognition, Maximal Cliques and Graph Coloring, Minimal Separators, Intersection Graphs of Subtrees

Famous quotes containing the word graph:

    When producers want to know what the public wants, they graph it as curves. When they want to tell the public what to get, they say it in curves.
    Marshall McLuhan (1911–1980)