Yingzhi Tian

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 39

Top Topics

Strongly Connected

Connected Graphs

Top Venues

Discret. Appl. Math.

Appl. Math. Comput.

Publications

Qing Yang, Yingzhi Tian
Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs. Discret. Math. 347 (5) (2024)
Yu Wang, Huiqiu Lin, Yingzhi Tian
Extremal spectral radius and essential edge-connectivity. Discret. Math. 347 (6) (2024)
Qinze Zhu, Yingzhi Tian
Extra connectivity of networks modeled by the strong product graphs. Appl. Math. Comput. 477 (2024)
Na Wang, Jixiang Meng, Yingzhi Tian
Reliability analyses of regular graphs based on edge-structure connectivity. Discret. Appl. Math. 356 (2024)
Hazhe Ye, Yingzhi Tian
The Restricted Edge-Connectivity of Strong Product Graphs. Axioms 13 (4) (2024)
Xuemei Liu, Jixiang Meng, Yingzhi Tian
On forcibly k-edge-connected and forcibly super edge-connected uniform hypergraphic sequences. J. Supercomput. 79 (14) (2023)
Qing Yang, Yingzhi Tian
Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three. Discret. Math. 346 (1) (2023)
Yingzhi Tian, Hong-Jian Lai, Jixiang Meng, Murong Xu
On the sizes of (k, l)-edge-maximal r-uniform hypergraphs. Discuss. Math. Graph Theory 43 (1) (2023)
Minglu Bai, Yingzhi Tian, Jiaqiong Yin
The Super Restricted Edge-connectedness of Direct Product Graphs. Parallel Process. Lett. 33 (3) (2023)
Qinglin Wang, Yingzhi Tian, Lihua Feng
On the Number of Edges in a 3-Uniform Hypergraph with No (k + 1)-Connected Hypersubgraphs. J. Interconnect. Networks 22 (1) (2022)
Na Wang, Jixiang Meng, Yingzhi Tian
Reliability evaluation of Modified bubble-sort graph networks based on structure fault pattern. Appl. Math. Comput. 430 (2022)
Lian Luo, Yingzhi Tian, Liyun Wu
-connected bipartite graphs. Discret. Math. 345 (4) (2022)
Xuemei Liu, Jixiang Meng, Yingzhi Tian
On forcibly k-connected and forcibly k-arc-connected digraphic sequences. Discret. Appl. Math. 321 (2022)
Na Wang, Jixiang Meng, Yingzhi Tian
Neighbor-connectivity of pancake networks and burnt pancake networks. Theor. Comput. Sci. 916 (2022)
Qinze Zhu, Yingzhi Tian
The g-Extra Connectivity of the Strong Product of Paths and Cycles. Symmetry 14 (9) (2022)
Liqiong Xu, Hong-Jian Lai, Yingzhi Tian, Murong Xu
The Extremal Sizes of Arc-Maximal (k, l)-Digraphs. Graphs Comb. 38 (3) (2022)
Jiaqiong Yin, Yingzhi Tian
Super Connected Direct Product of Graphs and Cycles. Axioms 11 (6) (2022)
Xiaomin Hu, Yingzhi Tian, Jixiang Meng, Weihua Yang
Conditional fractional matching preclusion of n-dimensional torus networks. Discret. Appl. Math. 293 (2021)
Liqiong Xu, Yingzhi Tian, Hong-Jian Lai
On the sizes of bi-k-maximal graphs. J. Comb. Optim. 39 (3) (2020)
Shuang Zhao, Yingzhi Tian, Jixiang Meng
Degree Sequence Conditions for Maximally Edge-Connected and Super Edge-Connected Hypergraphs. Graphs Comb. 36 (4) (2020)
Dejin Qin, Yingzhi Tian, Laihuan Chen, Jixiang Meng
Cyclic vertex-connectivity of Cartesian product graphs. Int. J. Parallel Emergent Distributed Syst. 35 (1) (2020)
Yingzhi Tian, Huaping Ma, Liyun Wu
The Connectivity of a Bipartite Graph and Its Bipartite Complementary Graph. Parallel Process. Lett. 30 (3) (2020)
Liqiong Xu, Hong-Jian Lai, Yingzhi Tian
On the extremal sizes of maximal graphs without (k+1)-connected subgraphs. Discret. Appl. Math. 285 (2020)
Xiaomin Hu, Weihua Yang, Yingzhi Tian, Jixiang Meng
Equal relation between g-good-neighbor diagnosability under the PMC model and g-good-neighbor diagnosability under the MM∗ model of a graph. Discret. Appl. Math. 262 (2019)
Ruifang Liu, Hong-Jian Lai, Yingzhi Tian, Yang Wu
Vertex-connectivity and eigenvalues of graphs with fixed girth. Appl. Math. Comput. (2019)
Yingzhi Tian, Hong-Jian Lai, Liqiong Xu, Jixiang Meng
Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs. Discret. Math. 342 (2) (2019)
Yingzhi Tian, Hong-Jian Lai, Jixiang Meng
On the Sizes of Vertex-k-Maximal r-Uniform Hypergraphs. Graphs Comb. 35 (5) (2019)
Yingzhi Tian, Jixiang Meng, Hong-Jian Lai, Liqiong Xu
Connectivity keeping stars or double-stars in 2-connected graphs. Discret. Math. 341 (4) (2018)
Xiaomin Hu, Yingzhi Tian, Xiaodong Liang, Jixiang Meng
-composition networks. Theor. Comput. Sci. 711 (2018)
Xiaomin Hu, Yingzhi Tian, Jixiang Meng
-vertex-connectedness. Appl. Math. Comput. 339 (2018)
Laihuan Chen, Jixiang Meng, Yingzhi Tian, Xiaodong Liang, Fengxia Liu
Connectivity of half vertex transitive digraphs. Appl. Math. Comput. 316 (2018)
Xiaomin Hu, Yingzhi Tian, Xiaodong Liang, Jixiang Meng
Matching preclusion for n-dimensional torus networks. Theor. Comput. Sci. 687 (2017)
Xiaomin Hu, Bin Zhao, Yingzhi Tian, Jixiang Meng
Matching preclusion for k-ary n-cubes with odd k ≥ 3. Discret. Appl. Math. 229 (2017)
Xianglan Cao, Yingzhi Tian, Jixiang Meng
Construction of super edge-connected multigraphs with prescribed degrees. Ars Comb. 127 (2016)
Xiaomin Hu, Yingzhi Tian, Xiaodong Liang, Jixiang Meng
Strong matching preclusion for n-dimensional torus networks. Theor. Comput. Sci. 635 (2016)
Bin Zhao, Laihuan Chen, Yuepeng Zhang, Yingzhi Tian, Jixiang Meng
On the page number of triple-loop networks with even cardinality. Ars Comb. 124 (2016)
Luihuan Chen, Jixiang Meng, Yingzhi Tian
cλ-optimally connected mixed Cayley graph. Ars Comb. 121 (2015)
Yingzhi Tian, Jixiang Meng
Restricted Connectivity for Some Interconnection Networks. Graphs Comb. 31 (5) (2015)
Haining Jiang, Jixiang Meng, Yingzhi Tian
The Harary index of digraphs. Ars Comb. 123 (2015)
Yingzhi Tian, Jixiang Meng, Hong-Jian Lai, Zhao Zhang
On the existence of super edge-connected graphs with prescribed degrees. Discret. Math. 328 (2014)
Yingzhi Tian, Jixiang Meng
On super connectedness and super restricted edge-connectedness of total graphs. Ars Comb. 114 (2014)
Weihua Yang, Yingzhi Tian, Hengzhe Li, Hao Li, Xiaofeng Guo
The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree. Discret. Appl. Math. 167 (2014)
Mingzu Zhang, Jixiang Meng, Weihua Yang, Yingzhi Tian
Reliability analysis of bijective connection networks in terms of the extra edge-connectivity. Inf. Sci. 279 (2014)
Yingzhi Tian, Jixiang Meng
On restricted edge-connectivity of vertex-transitive multigraphs. Int. J. Comput. Math. 91 (8) (2014)
Yingzhi Tian, Jixiang Meng
On super restricted edge-connectivity of vertex-transitive graphs. Ars Comb. 113 (2014)
Yingzhi Tian, Litao Guo, Jixiang Meng, Chengfu Qin
Inverse degree and super edge-connectivity. Int. J. Comput. Math. 89 (6) (2012)
Yingzhi Tian, Jixiang Meng, Xiaodong Liang
On Super Restricted Edge Connectivity of Half Vertex Transitive Graphs. Graphs Comb. 28 (2) (2012)
Yingzhi Tian, Jixiang Meng, Zhao Zhang
On the connectivity of p-diamond-free vertex transitive graphs. Discret. Appl. Math. 160 (7-8) (2012)
Yingzhi Tian, Jixiang Meng
-optimally connected mixed Cayley graphs. Appl. Math. Lett. 24 (6) (2011)
Yingzhi Tian, Jixiang Meng
Superconnected and Hyperconnected Small Degree Transitive Graphs. Graphs Comb. 27 (2) (2011)
Yingzhi Tian, Jixiang Meng
On super restricted edge-connectivity of edge-transitive graphs. Discret. Math. 310 (17-18) (2010)
Yingzhi Tian, Jixiang Meng
-Optimally half vertex transitive graphs with regularity k. Inf. Process. Lett. 109 (13) (2009)