Yingzhi Tian

61 papers Journal 61
YearRankTypeTitle / Venue / Authors
2026 J jnl
A survey on the vertex-(edge-)k-maximal graphs and the k-vertex-(edge-)connected graphs with redundant subgraphs.
Discret. Appl. Math.
Yingzhi Tian, Jixiang Meng
2026 J jnl
Forcibly unicyclic and bicyclic graphic sequences.
Discret. Math.
Peiyi Duan, Yingzhi Tian
2026 J jnl
The 3-restricted edge-connectivity of the direct product graphs.
Discret. Appl. Math.
Wenxin Wang, Yingzhi Tian
2025 J jnl
Characterizing the forbidden pairs for graphs to be super-edge-connected.
AKCE Int. J. Graphs Comb.
Hazhe Ye, Yingzhi Tian
2025 J jnl
Component connectivity of hierarchical pancake graphs.
J. Supercomput.
Hui Liu, Yingzhi Tian
2025 J jnl
Exploring redundant trees in bipartite graphs.
Appl. Math. Comput.
Qing Yang, Yingzhi Tian
2025 J jnl
Neighbor connectivity of hierarchical pancake networks.
Appl. Math. Comput.
Yu Fang, Yingzhi Tian
2025 J jnl
On the Sizes of Bi-k-Edge-Maximal r-Uniform Hypergraphs.
Graphs Comb.
Qinglin Wang, Yingzhi Tian
2025 J jnl
Proof of a conjecture on connectivity keeping odd paths in k-connected bipartite graphs.
Discret. Math.
Qing Yang, Yingzhi Tian
2024 J jnl
Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs.
Discret. Math.
Qing Yang, Yingzhi Tian
2024 J jnl
Extra connectivity of networks modeled by the strong product graphs.
Appl. Math. Comput.
Qinze Zhu, Yingzhi Tian
2024 J jnl
Extremal spectral radius and essential edge-connectivity.
Discret. Math.
Yu Wang, Huiqiu Lin, Yingzhi Tian
2024 J jnl
Reliability analyses of regular graphs based on edge-structure connectivity.
Discret. Appl. Math.
Na Wang, Jixiang Meng, Yingzhi Tian
2024 J jnl
The Restricted Edge-Connectivity of Strong Product Graphs.
Axioms
Hazhe Ye, Yingzhi Tian
2023 J jnl
Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three.
Discret. Math.
Qing Yang, Yingzhi Tian
2023 J jnl
On forcibly k-edge-connected and forcibly super edge-connected uniform hypergraphic sequences.
J. Supercomput.
Xuemei Liu, Jixiang Meng, Yingzhi Tian
2023 J jnl
On the sizes of (k, l)-edge-maximal r-uniform hypergraphs.
Discuss. Math. Graph Theory
Yingzhi Tian, Hong-Jian Lai, Jixiang Meng, Murong Xu
2023 J jnl
The Super Restricted Edge-connectedness of Direct Product Graphs.
Parallel Process. Lett.
Minglu Bai, Yingzhi Tian, Jiaqiong Yin
2022 J jnl
Connectivity keeping paths in
Discret. Math.
Lian Luo, Yingzhi Tian, Liyun Wu
2022 J jnl
Neighbor-connectivity of pancake networks and burnt pancake networks.
Theor. Comput. Sci.
Na Wang, Jixiang Meng, Yingzhi Tian
2022 J jnl
On forcibly k-connected and forcibly k-arc-connected digraphic sequences.
Discret. Appl. Math.
Xuemei Liu, Jixiang Meng, Yingzhi Tian
2022 J jnl
On the Number of Edges in a 3-Uniform Hypergraph with No (k + 1)-Connected Hypersubgraphs.
J. Interconnect. Networks
Qinglin Wang, Yingzhi Tian, Lihua Feng
2022 J jnl
Reliability evaluation of Modified bubble-sort graph networks based on structure fault pattern.
Appl. Math. Comput.
Na Wang, Jixiang Meng, Yingzhi Tian
2022 J jnl
Super Connected Direct Product of Graphs and Cycles.
Axioms
Jiaqiong Yin, Yingzhi Tian
2022 J jnl
The Extremal Sizes of Arc-Maximal (k, l)-Digraphs.
Graphs Comb.
Liqiong Xu, Hong-Jian Lai, Yingzhi Tian, Murong Xu
2022 J jnl
The g-Extra Connectivity of the Strong Product of Paths and Cycles.
Symmetry
Qinze Zhu, Yingzhi Tian
2021 J jnl
Conditional fractional matching preclusion of n-dimensional torus networks.
Discret. Appl. Math.
Xiaomin Hu, Yingzhi Tian, Jixiang Meng, Weihua Yang
2020 J jnl
Cyclic vertex-connectivity of Cartesian product graphs.
Int. J. Parallel Emergent Distributed Syst.
Dejin Qin, Yingzhi Tian, Laihuan Chen, Jixiang Meng
2020 J jnl
Degree Sequence Conditions for Maximally Edge-Connected and Super Edge-Connected Hypergraphs.
Graphs Comb.
Shuang Zhao, Yingzhi Tian, Jixiang Meng
2020 J jnl
On the extremal sizes of maximal graphs without (k+1)-connected subgraphs.
Discret. Appl. Math.
Liqiong Xu, Hong-Jian Lai, Yingzhi Tian
2020 J jnl
On the sizes of bi-k-maximal graphs.
J. Comb. Optim.
Liqiong Xu, Yingzhi Tian, Hong-Jian Lai
2020 J jnl
The Connectivity of a Bipartite Graph and Its Bipartite Complementary Graph.
Parallel Process. Lett.
Yingzhi Tian, Huaping Ma, Liyun Wu
2019 J jnl
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.
Xiaomin Hu, Weihua Yang, Yingzhi Tian, Jixiang Meng
2019 J jnl
Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs.
Discret. Math.
Yingzhi Tian, Hong-Jian Lai, Liqiong Xu, Jixiang Meng
2019 J jnl
On the Sizes of Vertex-k-Maximal r-Uniform Hypergraphs.
Graphs Comb.
Yingzhi Tian, Hong-Jian Lai, Jixiang Meng
2019 J jnl
Vertex-connectivity and eigenvalues of graphs with fixed girth.
Appl. Math. Comput.
Ruifang Liu, Hong-Jian Lai, Yingzhi Tian, Yang Wu
2018 J jnl
Connectivity keeping stars or double-stars in 2-connected graphs.
Discret. Math.
Yingzhi Tian, Jixiang Meng, Hong-Jian Lai, Liqiong Xu
2018 J jnl
Connectivity of half vertex transitive digraphs.
Appl. Math. Comput.
Laihuan Chen, Jixiang Meng, Yingzhi Tian, Xiaodong Liang, Fengxia Liu
2018 J jnl
Strong matching preclusion for
Theor. Comput. Sci.
Xiaomin Hu, Yingzhi Tian, Xiaodong Liang, Jixiang Meng
2018 J jnl
Super
Appl. Math. Comput.
Xiaomin Hu, Yingzhi Tian, Jixiang Meng
2017 J jnl
Matching preclusion for k-ary n-cubes with odd k ≥ 3.
Discret. Appl. Math.
Xiaomin Hu, Bin Zhao, Yingzhi Tian, Jixiang Meng
2017 J jnl
Matching preclusion for n-dimensional torus networks.
Theor. Comput. Sci.
Xiaomin Hu, Yingzhi Tian, Xiaodong Liang, Jixiang Meng
2016 J jnl
Construction of super edge-connected multigraphs with prescribed degrees.
Ars Comb.
Xianglan Cao, Yingzhi Tian, Jixiang Meng
2016 J jnl
On the page number of triple-loop networks with even cardinality.
Ars Comb.
Bin Zhao, Laihuan Chen, Yuepeng Zhang, Yingzhi Tian, Jixiang Meng
2016 J jnl
Strong matching preclusion for n-dimensional torus networks.
Theor. Comput. Sci.
Xiaomin Hu, Yingzhi Tian, Xiaodong Liang, Jixiang Meng
2015 J jnl
Restricted Connectivity for Some Interconnection Networks.
Graphs Comb.
Yingzhi Tian, Jixiang Meng
2015 J jnl
The Harary index of digraphs.
Ars Comb.
Haining Jiang, Jixiang Meng, Yingzhi Tian
2015 J jnl
cλ-optimally connected mixed Cayley graph.
Ars Comb.
Luihuan Chen, Jixiang Meng, Yingzhi Tian
2014 J jnl
On restricted edge-connectivity of vertex-transitive multigraphs.
Int. J. Comput. Math.
Yingzhi Tian, Jixiang Meng
2014 J jnl
On super connectedness and super restricted edge-connectedness of total graphs.
Ars Comb.
Yingzhi Tian, Jixiang Meng
2014 J jnl
On super restricted edge-connectivity of vertex-transitive graphs.
Ars Comb.
Yingzhi Tian, Jixiang Meng
2014 J jnl
On the existence of super edge-connected graphs with prescribed degrees.
Discret. Math.
Yingzhi Tian, Jixiang Meng, Hong-Jian Lai, Zhao Zhang
2014 J jnl
Reliability analysis of bijective connection networks in terms of the extra edge-connectivity.
Inf. Sci.
Mingzu Zhang, Jixiang Meng, Weihua Yang, Yingzhi Tian
2014 J jnl
The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree.
Discret. Appl. Math.
Weihua Yang, Yingzhi Tian, Hengzhe Li, Hao Li, Xiaofeng Guo
2012 J jnl
Inverse degree and super edge-connectivity.
Int. J. Comput. Math.
Yingzhi Tian, Litao Guo, Jixiang Meng, Chengfu Qin
2012 J jnl
On Super Restricted Edge Connectivity of Half Vertex Transitive Graphs.
Graphs Comb.
Yingzhi Tian, Jixiang Meng, Xiaodong Liang
2012 J jnl
On the connectivity of p-diamond-free vertex transitive graphs.
Discret. Appl. Math.
Yingzhi Tian, Jixiang Meng, Zhao Zhang
2011 J jnl
Superconnected and Hyperconnected Small Degree Transitive Graphs.
Graphs Comb.
Yingzhi Tian, Jixiang Meng
2011 J jnl
λ
Appl. Math. Lett.
Yingzhi Tian, Jixiang Meng
2010 J jnl
On super restricted edge-connectivity of edge-transitive graphs.
Discret. Math.
Yingzhi Tian, Jixiang Meng
2009 J jnl
lambda
Inf. Process. Lett.
Yingzhi Tian, Jixiang Meng