Yingzhi Tian

activity

20142026

most citedConnectivity keeping stars or double-stars in 2-connected graphs

1 citations · 2 across the 18 of their papers we have counts for

collaborators

19 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…

math.CO2023★ 1 cited

Extra Connectivity of Strong Product of Graphs

Qinze Zhu, Yingzhi Tian

The $g$ - $e x t r a$ $co nn ec t i v i t y$ $κ_{g} (G)$ of a connected graph $G$ is the minimum cardinality of a set of vertices, if it exists, whose deletion makes $G$ disconnected and leaves e…

math.CO2023

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 $T$ with bipartition $X$ and $Y$ , every $k$ -connected bipartite graph $G$ with $δ (G) \geq k + t$ , where $t = \max\{|X|,|Y |\}…

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

Proof a conjecture on connectivity keeping odd paths in k-connected bipartite graphs

Qing Yang, Yingzhi Tian

Luo, Tian and Wu (2022) conjectured that for any tree $T$ with bipartition $X$ and $Y$ , every $k$ -connected bipartite graph $G$ with minimum degree at least $k + t$ , where $t =$ max$\{…

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…

math.CO2022

Super connected direct product of graphs and cycles

Jiaqiong Yin, Yingzhi Tian

The topology of an interconnection network can be modeled by a graph $G = (V (G), E (G))$ . The connectivity of graph $G$ is a parameter to measure the reliability of corresponding netwo…

math.CO2022

Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three

Qing Yang, Yingzhi Tian

A conjecture of Luo, Tian and Wu (2022) says that for every positive integer $k$ and every finite tree $T$ with bipartition $X$ and $Y$ (denote $t = max {∣ X ∣, ∣ Y ∣})$ , every $k$ -c…

math.CO2019

The connectivity of a bipartite graph and its bipartite complementary graph

Huaping Ma, Yingzhi Tian, Liyun Wu

In 1956, Nordhaus and Gaddum gave lower and upper bounds on the sum and the product of the chromatic number of a graph and its complement, in terms of the order of the graph. Since…

math.CO2018

Spanning tree packing, edge-connectivity and eigenvalues of graphs with given girth

Ruifang Liu, Hong-Jian Lai, Yingzhi Tian

Let $τ (G)$ and $κ^{'} (G)$ denote the edge-connectivity and the spanning tree packing number of a graph $G$ , respectively. Proving a conjecture initiated by Cioaba and Wong, Liu et al.…

math.CO2018

On the sizes of $(k, l)$ -edge-maximal $r$ -uniform hypergraphs

Yingzhi Tian, Hong-Jian Lai, Jixiang Meng +1

Let $H = (V, E)$ be a hypergraph, where $V$ is a set of vertices and $E$ is a set of non-empty subsets of $V$ called edges. If all edges of $H$ have the same cardinality $r$ , then $H$ …

math.CO2018

On the sizes of $k$ -edge-maximal $r$ -uniform hypergraphs

Yingzhi Tian, Liqiong Xu, Hong-Jian Lai +1

Let $H = (V, E)$ be a hypergraph, where $V$ is a set of vertices and $E$ is a set of non-empty subsets of $V$ called edges. If all edges of $H$ have the same cardinality $r$ , then $H$ …

math.CO2017

Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs

Yingzhi Tian, Hong-Jian Lai, Liqiong Xu +1

Mader [J. Graph Theory 65 (2010) 61-69] conjectured that for every positive integer $k$ and every finite tree $T$ with order $m$ , every $k$ -connected, finite graph $G$ with $δ(G)\g…

math.CO2017★ 1 cited

Connectivity keeping stars or double-stars in 2-connected graphs

Yingzhi Tian, Jixiang Meng, Hong-Jian Lai +1

In [W. Mader, Connectivity keeping paths in $k$ -connected graphs, J. Graph Theory 65 (2010) 61-69.], Mader conjectured that for every positive integer $k$ and every finite tree $T$ …

math.CO2014

On restricted edge-connectivity of half-transitive multigraphs

Yingzhi Tian, Jixiang Meng, Xing Chen

Let $G = (V, E)$ be a multigraph (it has multiple edges, but no loops). The edge connectivity, denoted by $λ (G)$ , is the cardinality of a minimum edge-cut of $G$ . We call $G$ maximall…

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

Extra Connectivity of Strong Product of Graphs

Connectivity keeping trees in 3-connected bipartite graphs with girth conditions

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

The super restricted edge-connectedness of direct product graphs

Proof a conjecture on connectivity keeping odd paths in k-connected bipartite graphs

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

Super connected direct product of graphs and cycles

Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three

The connectivity of a bipartite graph and its bipartite complementary graph

Spanning tree packing, edge-connectivity and eigenvalues of graphs with given girth

On the sizes of (k,l)-edge-maximal r-uniform hypergraphs

On the sizes of k-edge-maximal r-uniform hypergraphs

Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs

Connectivity keeping stars or double-stars in 2-connected graphs

On restricted edge-connectivity of half-transitive multigraphs

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

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

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

On the sizes of $(k, l)$ -edge-maximal $r$ -uniform hypergraphs

On the sizes of $k$ -edge-maximal $r$ -uniform hypergraphs