(redirected from Chordal graph)
Also found in: Medical, Wikipedia.


1. Of or relating to the strings of an instrument.
2. Relating to or consisting of a harmonic chord.
3. Giving prominence to harmonic rather than contrapuntal structure: chordal music.
American Heritage® Dictionary of the English Language, Fifth Edition. Copyright © 2016 by Houghton Mifflin Harcourt Publishing Company. Published by Houghton Mifflin Harcourt Publishing Company. All rights reserved.


(ˈkɔr dl)

1. of, pertaining to, or resembling a chord.
2. of or pertaining to music that is marked principally by vertical harmonic movement rather than by linear polyphony.
Random House Kernerman Webster's College Dictionary, © 2010 K Dictionaries Ltd. Copyright 2005, 1997, 1991 by Random House, Inc. All rights reserved.
ThesaurusAntonymsRelated WordsSynonymsLegend:
Adj.1.chordal - relating to or consisting of or emphasizing chords; "chordal assonance in modern music"; "chordal rather than contrapuntal music"
Based on WordNet 3.0, Farlex clipart collection. © 2003-2012 Princeton University, Farlex Inc.


adj (Mus) → Akkord-
Collins German Dictionary – Complete and Unabridged 7th Edition 2005. © William Collins Sons & Co. Ltd. 1980 © HarperCollins Publishers 1991, 1997, 1999, 2004, 2005, 2007
References in periodicals archive ?
Suppose (G, m) is an edge-labeled chordal graph with elimination ordering [[upsilon].sub.0], ..., [[upsilon].sub.l] satisfying that [[upsilon].sub.i] is a free vertex of the induced sub-graph on {[[upsilon].sub.0], ..., [[upsilon].sub.i]} for every i [greater than or equal to] 2.
Let G be a probe diamond-free and chordal graph. By Theorem 6, G is, in particular, {[F.sub.1],S, [T.sub.1]}-free and [F.sub.2]-free.
It is known that [L.sub.k](K) [less than or equal to] 1 if and only if K is the clique complex of a chordal graph, cf.
The chromatic polynomial of a chordal graph G with n vertices is of the form [[chi].sub.G](t) = [[PI].sup.n.sub.i=1](t - [e.sub.i]).
Lemma 3 Let G be a chordal graph and V' [subset] V a clique of G with V' [not equal to] V.
Lemma 4.10 Let G be a chordal graph and [tau] and [rho] be two LBFS orderings of G.
In this case, no induced hole of G can contain more than 4 vertices, and thus G is a weakly chordal graph.
For some special graph families, we have explicit formulae for computing competition numbers: If G is a chordal graph without isolated vertices, then k(G) = 1; If G is a nontrivial triangle-free connected graph then k(G) = [absolute value of E(G)] - [absolute value of V(G)] + 2 ([12]).
A chordal graph is a graph in which every cycle of length at least four has a chord.
Our next result states that a split-decreasing graph with two connected components is not a chordal graph.
((ii)) A graph is chordal probe if its vertices can be partitioned into two sets P (probes) and N (nonprobes) with N an independent set and G can be extended to a chordal graph by adding edges between nonprobes.