Windmill

Материал из WEGA
Версия от 15:20, 30 августа 2011; Glk (обсуждение | вклад) (Новая страница: «'''Windmill''' --- ветряная мельница. A ''' windmill''', denoted by <math>pS.K_{r}</math>, is the graph obtained by ''coalescing'' a complete graph…»)
(разн.) ← Предыдущая версия | Текущая версия (разн.) | Следующая версия → (разн.)

Windmill --- ветряная мельница.

A windmill, denoted by [math]\displaystyle{ pS.K_{r} }[/math], is the graph obtained by coalescing a complete graph [math]\displaystyle{ K_{r} }[/math], [math]\displaystyle{ r \geq 2 }[/math], with [math]\displaystyle{ p }[/math] disjoint copies of a graph [math]\displaystyle{ S(v) }[/math], rooted at [math]\displaystyle{ v \in V(S), \; 0 \leq p \leq r }[/math]. The root vertex, [math]\displaystyle{ v }[/math], in the labelled graph [math]\displaystyle{ S }[/math], is identified with one vertex of [math]\displaystyle{ K_{r} }[/math] so that [math]\displaystyle{ p }[/math] distinct vertices of [math]\displaystyle{ K_{r} }[/math] are cut vertices of the windmill.