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:
“In this Journal, my pen is a delicate needle point, tracing out a graph of temperament so as to show its daily fluctuations: grave and gay, up and down, lamentation and revelry, self-love and self-disgust. You get here all my thoughts and opinions, always irresponsible and often contradictory or mutually exclusive, all my moods and vapours, all the varying reactions to environment of this jelly which is I.”
—W.N.P. Barbellion (1889–1919)