Chenxu Yang

activity

20232026

collaborators

Showing 2023Show all

2 papers · 1 filter

math.CO2023

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.DM2023

Perturbation results for distance-edge-monitoring numbers

Chenxu Yang, Ralf Klasing, Changxiang He +1

Foucaud et al. recently introduced and initiated the study of a new graph-theoretic concept in the area of network monitoring. Given a graph $G = (V (G), E (G))$ , a set $M \subseteq V(…