Trampoline of order p

Trampoline of order [math]\displaystyle{ p }[/math] --- трамполин порядка [math]\displaystyle{ p }[/math].

A trampoline of order [math]\displaystyle{ p }[/math] ([math]\displaystyle{ p \geq 3 }[/math]) is a graph obtained from a [math]\displaystyle{ p }[/math]-cycle [math]\displaystyle{ C }[/math] by adding enough chords to make it chordal, and adding for each edge (not chord) of [math]\displaystyle{ C }[/math] a new vertex adjacent only to the two ends of that edge.