1 citations · 1 across the 7 of their papers we have counts for
13 papers
Extremal Problems for the Family of -Strongly Connected Digraphs
Qinglin Wang, Yingzhi Tian
Let be a family of digraphs. A digraph is \emph{-saturated} if it contains no member of as a subdigraph, but for any arc in the com…
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…
On the Steiner -diameter and Steiner ()-radius of trees
Qingnan Zhang, Yingzhi Tian
Given a connected graph and a -set , the of is defined as the size of a minimum tree including in . The $St…
Forcibly unicyclic and bicyclic graphic sequences
Peiyi Duan, Yingzhi Tian
A sequence of non-negative integers is called a graphic sequence if there is a simple graph with vertices such that the degree of $v_i…
Extra Connectivity of Strong Product of Graphs
Qinze Zhu, Yingzhi Tian
The - of a connected graph is the minimum cardinality of a set of vertices, if it exists, whose deletion makes disconnected and leaves e…
Connectivity keeping trees in 3-connected bipartite graphs with girth conditions
Qing Yang, Yingzhi Tian
Luo, Tian and Wu conjectured in 2022 that for any tree with bipartition and , every -connected bipartite graph with , where $t = \max\{|X|,|Y |\}…