Adjacent forest graph: различия между версиями

'''Adjacent forest graph''' --- смежный граф лесов.  

Let <math>G</math> be a connected graph. Given <math>1 \leq \omega \leq |V(G)| - 1</math>,

the '''adjacent forest graph''' of <math>G</math>, denoted by

<math>F_{\omega}^{a}(G)</math>, is defined as a spanning subgraph of a ''forest graph'' <math>F_{\omega}(G)</math>; its two vertices are adjacent if and only if

the only two edges in the symmetric difference of their corresponding

forests are adjacent in <math>G</math>.

*'' Forest graph''.