Yingzhi Tian

collaborators

4 papers

math.CO2026

Extremal Problems for the Family of $k$ -Strongly Connected Digraphs

Qinglin Wang, Yingzhi Tian

Let $D$ be a family of digraphs. A digraph $D$ is \emph{ $D$ -saturated} if it contains no member of $D$ as a subdigraph, but for any arc $e$ in the com…

math.CO2025

The 3-restricted edge-connectivity of the direct product graphs

Wenxin Wang, Yingzhi Tian

An edge subset $ S \subseteq E(G) $ is called a 3-restricted edge-cut if $ G - S $ is disconnected and each component of $ G - S $ contains at least three vertices. The 3-res…

math.CO2025

On the Steiner $k$ -diameter and Steiner ( $k, k^{'}$ )-radius of trees

Qingnan Zhang, Yingzhi Tian

Given a connected graph $G = (V, E)$ and a $k$ -set $S \subseteq V (G)$ , the $S t e in er$ $d i s t an ce$ $d_{G} (S)$ of $S$ is defined as the size of a minimum tree including $S$ in $G$ . The $St…

math.CO2025

Forcibly unicyclic and bicyclic graphic sequences

Peiyi Duan, Yingzhi Tian

A sequence $D = (d_{1}, d_{2}, \dots, d_{n})$ of non-negative integers is called a graphic sequence if there is a simple graph with vertices $v_{1}, v_{2}, \dots, v_{n}$ such that the degree of $v_i…

Extremal Problems for the Family of k-Strongly Connected Digraphs

The 3-restricted edge-connectivity of the direct product graphs

On the Steiner k-diameter and Steiner (k,k′)-radius of trees

Forcibly unicyclic and bicyclic graphic sequences

Extremal Problems for the Family of $k$ -Strongly Connected Digraphs

On the Steiner $k$ -diameter and Steiner ( $k, k^{'}$ )-radius of trees