# Reconfiguration of Spanning Trees with Many or Few Leaves

Let G be a graph and T_1,T_2 be two spanning trees of G. We say that T_1 can be transformed into T_2 via an edge flip if there exist two edges e ∈ T_1 and f in T_2 such that T_2= (T_1 ∖ e) ∪ f. Since spanning trees form a matroid, one can indeed transform a spanning tree into any other via a sequence of edge flips, as observed by Ito et al. We investigate the problem of determining, given two spanning trees T_1,T_2 with an additional property Π, if there exists an edge flip transformation from T_1 to T_2 keeping property Π all along. First we show that determining if there exists a transformation from T_1 to T_2 such that all the trees of the sequence have at most k (for any fixed k ≥ 3) leaves is PSPACE-complete. We then prove that determining if there exists a transformation from T_1 to T_2 such that all the trees of the sequence have at least k leaves (where k is part of the input) is PSPACE-complete even restricted to split, bipartite or planar graphs. We complete this result by showing that the problem becomes polynomial for cographs, interval graphs and when k=n-2.

• 43 publications
• 25 publications
• 36 publications
• 5 publications
• 6 publications
• 12 publications
• 20 publications
research
03/18/2019

### The facets of the spanning trees polytope

Let G=(V, E) be an undirected graph. The spanning trees polytope P(G) is...
research
01/12/2022

### Reconfiguration of Spanning Trees with Degree Constraint or Diameter Constraint

We investigate the complexity of finding a transformation from a given s...
research
02/03/2022

### Pivot Gray Codes for the Spanning Trees of a Graph ft. the Fan

We consider the problem of listing all spanning trees of a graph G such ...
research
09/30/2022

### A Complete Set of Connectivity-aware Local Topology Manipulation Operations for Robot Swarms

The topology of a robotic swarm affects the convergence speed of consens...
research
06/24/2022

### A transient equivalence between Aldous-Broder and Wilson's algorithms and a two-stage framework for generating uniform spanning trees

The Aldous-Broder and Wilson are two well-known algorithms to generate u...
research
11/03/2022

### Distributed Reconfiguration of Spanning Trees

In a reconfiguration problem, given a problem and two feasible solutions...
research
06/27/2018

### Linear Algebra and Number of Spanning Trees

A network-theoretic approach for determining the complexity of a graph i...