Flower

Материал из WEGA
Версия от 14:24, 3 мая 2011; Glk (обсуждение | вклад) (Новая страница: «'''Flower''' --- цветок. A '''flower''' <math>F</math> is a connected graph of order 8 which contains a cut-vertex <math>w</math> such that each component of…»)
(разн.) ← Предыдущая версия | Текущая версия (разн.) | Следующая версия → (разн.)

Flower --- цветок.

A flower [math]\displaystyle{ F }[/math] is a connected graph of order 8 which contains a cut-vertex [math]\displaystyle{ w }[/math] such that each component of [math]\displaystyle{ F \setminus w }[/math] has order at most 3. The vertex [math]\displaystyle{ w }[/math] is called a stamen of flower and the components of flower are called its petals.