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:	Discrete mathematics Spanning tree Tree graph Feedback arc set Tree (graph theory) Theoretical Computer Science Δ∗-dense Combinatorics Graph power Cycle space Discrete Mathematics and Combinatorics Cycle basis Regular graph Graph factorization Complement graph Mathematics
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:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ea1d01f52a51f04c9caf6ec52fc35667 https://doi.org/10.1016/s0012-365x(03)00132-8 Zobrazit plný text záznamu Full Text from ScienceDirect