On a tree graph defined by a set of cycles
Autor: | Victor Neumann-Lara, Eduardo Rivera-Campo, Xueliang Li |
---|---|
Rok vydání: | 2003 |
Předmět: | |
Zdroj: | Discrete Mathematics. 271:303-310 |
ISSN: | 0012-365X |
Popis: | 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. |
Databáze: | OpenAIRE |
Externí odkaz: |