Disjoint Connectivity Keeping Trees

• Disjoint connectivity keeping trees are subtrees with strict disjointness (edge-, vertex-, or internally disjoint) that maintain connectivity and bolster network reliability.
• They employ advanced graph-theoretical methods, including spectral analysis and combinatorial optimization, to determine connectivity thresholds and packing limits.
• Applications include network fault tolerance, distributed algorithms, and reliable broadcasting, with significant focus on algorithmic complexity and NP-completeness challenges.

A disjoint connectivity keeping tree is a subtree structure with a highly constrained disjointness property, central to the study of network reliability, generalized connectivity, and resilience. In its most common forms, it refers to a set of connectivity-maintaining (e.g., spanning, Steiner, or pendant-Steiner) trees that are either edge-disjoint, vertex-disjoint, internally disjoint, or satisfy weaker/stronger joint intersection constraints, with variants in both undirected and directed graphs. The packing, construction, and extremal limits of such trees—especially their generalized $k$-connectivity and algorithmic complexity—constitute a vibrant area at the intersection of graph theory, combinatorial optimization, and distributed algorithms.

1. Foundational Notions and Disjointness Variants

A connectivity keeping tree in a graph $G=(V,E)$ connects a specified set of terminals $S\subseteq V$ (often all of $V$, yielding a spanning tree), such that removal of its vertices/edges from $G$ preserves or achieves some connectivity property. The strictest form is internally disjoint $S$-Steiner trees: for $|S|\ge2$, $T_1,\dots,T_\ell$ are pairwise edge-disjoint and $V(T_i)\cap V(T_j)=S$ for all $i\neq j$ (Li et al., 2010, Li et al., 2012). Edge-disjointness, vertex-disjointness, and pendant (all terminals have degree 1) variants are also prominent (Mao, 2015, Yu et al., 1 May 2025).

In directed graphs, the analogous object is an internally disjoint out-tree: each tree is rooted at a terminal $G=(V,E)$0, covers $G=(V,E)$1, and trees only overlap at $G=(V,E)$2 (Sun et al., 2020, Sun, 2020).

A generalization is the $G=(V,E)$3-disjoint spanning tree framework, quantifying the maximum number of common inner vertices ($G=(V,E)$4) and edges ($G=(V,E)$5) permitted between trees, interpolating between edge-disjoint, vertex-disjoint, and the stringent completely independent spanning trees where both $G=(V,E)$6 (Darties et al., 2017).

2. Generalized Connectivity and Packing Numbers

The central invariant is the generalized $G=(V,E)$7-connectivity: $G=(V,E)$8 where $G=(V,E)$9 is the maximum number of internally disjoint $S\subseteq V$0-Steiner trees (Li et al., 2010, Yang et al., 2023). Analogously, the generalized $S\subseteq V$1-edge-connectivity $S\subseteq V$2 is defined via edge-disjointness (Yang et al., 2023). For directed graphs, these parameters extend to $S\subseteq V$3 and $S\subseteq V$4 via out-trees (Sun et al., 2020, Sun, 2020):

$S\subseteq V$5

$S\subseteq V$6

These are the primary group-based resilience measures in the presence of vertex or edge failures.

The classical case $S\subseteq V$7 recovers usual (vertex/edge) connectivity. For $S\subseteq V$8, computing $S\subseteq V$9 or $V$0 becomes substantially more challenging, often NP-complete (Li et al., 2010, Sun et al., 2020).

3. Extremal, Spectral, and Algorithmic Results

Min-Max Packing and Tightness

The Tutte-Nash-Williams theorem gives the exact packing number $V$1 of edge-disjoint spanning trees in undirected graphs: $V$2 with $V$3 ranging over all partitions of $V$4 (Bailey et al., 2010, Chandrasekaran et al., 25 Mar 2025). Equality $V$5 (where $V$6 is minimum edge-cut size) precisely characterizes maximum packable cases; such graphs decompose into $V$7-irreducible components along tight edge-cuts (Bailey et al., 2010).

Spectral Methods

Spectral bounds connect adjacency and signless Laplacian eigenvalues to edge-connectivity and tree packing: for $V$8 in a suitable family $V$9, if the third-largest adjacency eigenvalue $G$0 and signless Laplacian eigenvalue $G$1 satisfy explicit inequalities parameterized by minimum/maximum degrees $G$2 and the target packing $G$3, then packing and connectivity thresholds hold (see Table):

Condition	Spectral Bound (Adjacency)	Spectral Bound (Signless Laplacian)
$G$4	$G$5	$G$6
$G$7	$G$8	$G$9

This framework uses quotient matrices and eigenvalue interlacing to force the minimum cut to be large enough to ensure $S$0 edge-disjoint trees (Duan et al., 2017).

Complexity and Algorithms

• For fixed $S$1, determining whether $S$2 contains $S$3 internally disjoint $S$4-trees for a fixed $S$5, or $S$6, is polynomial-time solvable, leveraging the bounded number of tree isomorphism types and Robertson–Seymour linkage algorithms (Li et al., 2010).
• NP-completeness arises as soon as either $S$7 (the terminal set size) or $S$8 (the number of trees) is variable, even for moderate parameter values (Li et al., 2010, Sun et al., 2020).
• Online and distributed models: various approximation algorithms with $S$9 competitive ratios for online packing of disjoint spanning trees (viewed as packing polymatroid bases), using randomized coloring and quotient techniques (Chandrasekaran et al., 25 Mar 2025). In distributed models, fast $|S|\ge2$0-round algorithms achieve close to optimal fractional tree packings and support low-congestion routing (Censor-Hillel et al., 2013).

4. Specialized Constructions and Extremal Results

Sierpiński and Product Graphs

In recursive Sierpiński graphs $|S|\ge2$1, explicit formulas for generalized connectivity are available: $|S|\ge2$2 Recursive constructions exploit atom partitions and Hamiltonian path decompositions to realize the maximal packing (Yang et al., 2023).

For Cartesian products $|S|\ge2$3, exact lower bounds on local pendant tree-connectivity are obtained: for $|S|\ge2$4, $|S|\ge2$5 (Mao, 2015).

Networks with Triangle- or Cycle-Free Constraints

In triangle-free graphs, high minimum degree (explicitly, $|S|\ge2$6 for a $|S|\ge2$7-connected graph and $|S|\ge2$8-vertex tree $|S|\ge2$9) ensures existence of a $T_1,\dots,T_\ell$0 whose removal preserves $T_1,\dots,T_\ell$1-connectivity (Chu et al., 10 Nov 2025). Girth and bipartite assumptions further sharpen the degree thresholds.

Extremal Edge Counts

For $T_1,\dots,T_\ell$2 (spanning trees), maximal edge counts with at most $T_1,\dots,T_\ell$3 edge-disjoint trees are characterized by

$T_1,\dots,T_\ell$4

and analogs for $T_1,\dots,T_\ell$5 and general $T_1,\dots,T_\ell$6, with extremal graphs constructed by connecting all but one vertex in a large clique and attaching smaller structures (Li et al., 2013, Li et al., 2012).

5. Directed Graphs: Out-Trees and Pendant Connectivity

Directed versions require careful adaptation:

• Directed generalized tree connectivity $T_1,\dots,T_\ell$7 considers the minimum number of internally disjoint out-trees rooted at a specified terminal subset $T_1,\dots,T_\ell$8, sharing vertices only in $T_1,\dots,T_\ell$9 (Sun et al., 2020, Sun, 2020).
• Pendant-tree connectivity $V(T_i)\cap V(T_j)=S$0 measures the minimum number of internally disjoint directed out-trees with all terminals as leaves; undirected and directed cases differ in both bounds and computational complexity (Yu et al., 1 May 2025).

Sharp upper bounds $V(T_i)\cap V(T_j)=S$1, and tight min-cut based inequalities are available, fully attainable in complete symmetric digraphs.

NP-completeness of packing pendant-trees or more general out-trees is the rule on Eulerian digraphs, but for symmetric digraphs and fixed parameters, polynomial-time results hold (Yu et al., 1 May 2025).

6. Applications and Interpretations

Disjoint connectivity keeping trees are fundamental in:

• Network reliability: maximizing the number of edge-disjoint or vertex-disjoint spanning/Steiner/multicast trees corresponds directly to multi-route communication resilience, fault-tolerant broadcasting, and capacity provisioning (Censor-Hillel et al., 2013, Bailey et al., 2010, Hoyer et al., 2017).
• Distributed and online systems: distributed decomposition and tree-packing underpins optimal message routing, parallel communication, and network repair strategies (Censor-Hillel et al., 2013, Chandrasekaran et al., 25 Mar 2025).

Network models also benefit from fine-grained $V(T_i)\cap V(T_j)=S$2-disjointness, interpolating between strict and loose redundancy requirements (Darties et al., 2017).

7. Open Problems and Future Directions

Open questions include:

• Precise determination of extremal functions $V(T_i)\cap V(T_j)=S$3 for $V(T_i)\cap V(T_j)=S$4 or arbitrary $V(T_i)\cap V(T_j)=S$5, and characterization of extremal graph families (Li et al., 2012, Li et al., 2013).
• Reducing degree thresholds for connectivity-keeping trees in triangle-free or $V(T_i)\cap V(T_j)=S$6-free graphs, and resolving conjectured lower bounds (Chu et al., 10 Nov 2025, Hasunuma, 16 Nov 2025).
• Achieving $V(T_i)\cap V(T_j)=S$7-competitive ratios for online tree packing, or extending structural decompositions to broader matroid classes (Chandrasekaran et al., 25 Mar 2025).
• Full complexity dichotomy for directed pendant/Steiner packing—especially for variable parameter regimes (Yu et al., 1 May 2025, Sun et al., 2020).

These research avenues indicate the deep interplay between combinatorial structure, algorithmics, and extremal graph theory in the study of disjoint connectivity keeping trees.