chordal

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

chord·al

 (kôr′dl)
adj.
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.

chord•al

(ˈkɔr dl)

adj.
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.
[1610–20]
ThesaurusAntonymsRelated WordsSynonymsLegend:
Adj.1.chordal - relating to or consisting of or emphasizing chords; "chordal assonance in modern music"; "chordal rather than contrapuntal music"
Translations

chordal

adj (Mus) → Akkord-
References in periodicals archive ?
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].
Lemma 3 Let G be a chordal graph and V' [subset] V a clique of G with V' [not equal to] V.
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.
It is a well-known fact that a chordal graph has a simplicial vertex x, which clearly is safe.
Recall that a chordal graph is a graph with no induced cycles of length at least four [26, 51].
In this article we prove that the problem of computing the minimum cardinality of an open 0-monopoly in a graph is NP-complete even restricted to bipartite or chordal graphs.