Forest graph: различия между версиями
Перейти к навигации
Перейти к поиску
Glk (обсуждение | вклад) (Новая страница: «'''Forest graph''' --- граф лесов. Given <math>1 \leq \omega \leq |V(G)|-1</math>, the '''forest graph''' of <math>G</math> denoted by <math>F_{\omega}(G)…») |
(нет различий)
|
Текущая версия от 07:32, 3 мая 2011
Forest graph --- граф лесов.
Given [math]\displaystyle{ 1 \leq \omega \leq |V(G)|-1 }[/math], the forest graph of [math]\displaystyle{ G }[/math] denoted by [math]\displaystyle{ F_{\omega}(G) }[/math] is defined on the set of spanning forests of [math]\displaystyle{ G }[/math] with [math]\displaystyle{ \omega }[/math] components; two vertices are adjacent if and only if the symmetric difference of their corresponding forests has exactly two edges.
See
- Tree graph,
- adjacent forest graph.