Caterpillar: различия между версиями

Материал из WikiGrapp
Перейти к навигации Перейти к поиску
(Новая страница: «'''Caterpillar''' --- гусеница. '''1.''' A ''tree'' such that the removal of all ''pendant vertices'' or leaves (vertices with exactly one neighbor) yields…»)
(нет различий)

Версия от 15:40, 24 февраля 2011

Caterpillar --- гусеница.

1. A tree such that the removal of all pendant vertices or leaves (vertices with exactly one neighbor) yields a path is a caterpillar.


2. A caterpillar is a graph derived from a path by hanging any number of pendant vertices from vertices of the path.

3. A caterpillar [math]\displaystyle{ C }[/math] is a tree of order [math]\displaystyle{ n \geq 3 }[/math] whose pruned tree is a (possibly trivial) path.