Forest graph

Материал из WikiGrapp
Перейти к навигации Перейти к поиску

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.