Chordal graph

In the mathematical area of graph theory, a chordal graph is one in which all cycles of four or more vertices have a chord, which is an edge that is not part of the cycle but connects two vertices of the cycle. Equivalently, every induced cycle in the graph should have at most three vertices. The chordal graphs may also be characterized as the graphs that have perfect elimination orderings, as the graphs in which each minimal separator is a clique, and as the intersection graphs of subtrees of a tree. They are sometimes also called rigid circuit graphs or triangulated graphs.

单词	Triangulated graph
释义	Triangulated graph 英语百科 Chordal graph In the mathematical area of graph theory, a chordal graph is one in which all cycles of four or more vertices have a chord, which is an edge that is not part of the cycle but connects two vertices of the cycle. Equivalently, every induced cycle in the graph should have at most three vertices. The chordal graphs may also be characterized as the graphs that have perfect elimination orderings, as the graphs in which each minimal separator is a clique, and as the intersection graphs of subtrees of a tree. They are sometimes also called rigid circuit graphs or triangulated graphs.
随便看	relative tricuspid stenosis的意思 relative triple precision的意思 relative truth的意思 relative tumor size的意思 relative tumour volume的意思 relative turgidity的意思 relative twist的意思 relative unanimity的意思 Relative uncertainty的意思 relative uniform converge的意思 relative uniform convergence的意思 relative uniformity的意思 relative uniformity distribution的意思 relative uniform star convergence的意思 relative unit的意思 Relative URL的意思 relative utility的意思 relative vacuum gauge的意思 relative valency effect的意思 Relative value的意思 relative value approximation的意思 relative value form的意思 relative value funds的意思 relative value index的意思 relative value of consequence的意思

Triangulated graph

Chordal graph