Chord

Chord — хорда.

1. (For a subgraph [math]\displaystyle{ \,G_{1} }[/math] of [math]\displaystyle{ \,G }[/math]) An edge [math]\displaystyle{ e \in E(G) - E(G_{1}) }[/math] connecting two vertices of [math]\displaystyle{ \,G_{1} }[/math] is called a chord.

2. (For a hypergraph) A chord of a hypercycle [math]\displaystyle{ \,C }[/math] is an edge [math]\displaystyle{ \,e }[/math] with [math]\displaystyle{ e_{i} \cap e_{i+1\pmod{k}} \subseteq e }[/math] for at least three indices [math]\displaystyle{ \,i, \; 1 \leq i \leq k }[/math].

Литература

• Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.