On a tree graph defined by a set of cycles

For a set C of cycles of a connected graph G we define T(G,C) as the graph with one vertex for each spanning tree of G, in which two trees R and S are adjacent if R∪S contains exactly one cycle and this cycle lies in C. We give necessary conditions and sufficient conditions for T(G,C) to be connected.