Ralf Klasing

collaborators

2 papers

math.CO2025

Constructing disjoint Steiner trees in SierpiÅski graphs

Chenxu Yang, Ping Li, Yaping Mao +2

Let $G$ be a graph and $S \subseteq V (G)$ with $∣ S ∣ \geq 2$ . Then the trees $T_{1}, T_{2}, \dots, T_{ℓ}$ in $G$ are \emph{internally disjoint Steiner trees} connecting $S$ (or $S$ -Stei…

cs.DM2025

The $g$ -good-neighbor diagnosability of product networks under the PMC model

Zhao Wang, Yaping Mao, Sun-Yuan Hsieh +1

The concept of neighbor connectivity originated from the assessment of the subversion of espionage networks caused by underground resistance movements, and it has now been applied…

Constructing disjoint Steiner trees in SierpiÅski graphs

The g-good-neighbor diagnosability of product networks under the PMC model

Constructing disjoint Steiner trees in SierpiÅski graphs

The $g$ -good-neighbor diagnosability of product networks under the PMC model