Yingzhi Tian

collaborators

3 papers

math.CO2023

Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs

Qing Yang, Yingzhi Tian

Hasunuma [J. Graph Theory 102 (2023) 423-435] conjectured that for any tree $T$ of order $m$ , every $k$ -connected (or $k$ -edge-connected) graph $G$ with minimum degree at least $k+…

math.CO2023

The super restricted edge-connectedness of direct product graphs

Jiaqiong Yin, Yingzhi Tian

Let $G$ be a graph with vertex set $V (G)$ and edge set $E (G)$ . An edge subset $F \subseteq E (G)$ is called a restricted edge-cut if $G - F$ is disconnected and has no isolated vertice…

math.CO2022

The $g$ -extra connectivity of the strong product of paths and cycles

Qinze Zhu, Yingzhi Tian

Let $G$ be a connected graph and $g$ be a non-negative integer. The $g$ -extra connectivity of $G$ is the minimum cardinality of a set of vertices in $G$ , if it exists, whose remova…

Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs

The super restricted edge-connectedness of direct product graphs

The g-extra connectivity of the strong product of paths and cycles

The $g$ -extra connectivity of the strong product of paths and cycles