lambdac-Optimally half vertex transitive graphs with regularity k. - Yingzhi Tian; Jixiang Meng (Inf. Process. Lett., 2009)

On super restricted edge-connectivity of edge-transitive graphs. - Yingzhi Tian; Jixiang Meng (Discret. Math., 2010)

λ′-optimally connected mixed Cayley graphs. - Yingzhi Tian; Jixiang Meng (Appl. Math. Lett., 2011)

Superconnected and Hyperconnected Small Degree Transitive Graphs. - Yingzhi Tian; Jixiang Meng (Graphs Comb., 2011)

On the connectivity of p-diamond-free vertex transitive graphs. - Yingzhi Tian; Jixiang Meng; Zhao Zhang 002 (Discret. Appl. Math., 2012)

On Super Restricted Edge Connectivity of Half Vertex Transitive Graphs. - Yingzhi Tian; Jixiang Meng; Xiaodong Liang (Graphs Comb., 2012)

Inverse degree and super edge-connectivity. - Yingzhi Tian; Litao Guo; Jixiang Meng; Chengfu Qin (Int. J. Comput. Math., 2012)

On super restricted edge-connectivity of vertex-transitive graphs. - Yingzhi Tian; Jixiang Meng (Ars Comb., 2014)

On super connectedness and super restricted edge-connectedness of total graphs. - Yingzhi Tian; Jixiang Meng (Ars Comb., 2014)

The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree. - Weihua Yang; Yingzhi Tian; Hengzhe Li; Hao Li; Xiaofeng Guo (Discret. Appl. Math., 2014)

On the existence of super edge-connected graphs with prescribed degrees. - Yingzhi Tian; Jixiang Meng; Hong-Jian Lai; Zhao Zhang 002 (Discret. Math., 2014)

On restricted edge-connectivity of vertex-transitive multigraphs. - Yingzhi Tian; Jixiang Meng (Int. J. Comput. Math., 2014)

Reliability analysis of bijective connection networks in terms of the extra edge-connectivity. - Mingzu Zhang; Jixiang Meng; Weihua Yang; Yingzhi Tian (Inf. Sci., 2014)

cλ-optimally connected mixed Cayley graph. - Luihuan Chen; Jixiang Meng; Yingzhi Tian (Ars Comb., 2015)

The Harary index of digraphs. - Haining Jiang; Jixiang Meng; Yingzhi Tian (Ars Comb., 2015)

Restricted Connectivity for Some Interconnection Networks. - Yingzhi Tian; Jixiang Meng (Graphs Comb., 2015)

Construction of super edge-connected multigraphs with prescribed degrees. - Xianglan Cao; Yingzhi Tian; Jixiang Meng (Ars Comb., 2016)

On the page number of triple-loop networks with even cardinality. - Bin Zhao; Laihuan Chen; Yuepeng Zhang; Yingzhi Tian; Jixiang Meng (Ars Comb., 2016)

Strong matching preclusion for n-dimensional torus networks. - Xiaomin Hu; Yingzhi Tian; Xiaodong Liang; Jixiang Meng (Theor. Comput. Sci., 2016)

Matching preclusion for k-ary n-cubes with odd k ≥ 3. - Xiaomin Hu; Bin Zhao; Yingzhi Tian; Jixiang Meng (Discret. Appl. Math., 2017)

Matching preclusion for n-dimensional torus networks. - Xiaomin Hu; Yingzhi Tian; Xiaodong Liang; Jixiang Meng (Theor. Comput. Sci., 2017)

Connectivity of half vertex transitive digraphs. - Laihuan Chen; Jixiang Meng; Yingzhi Tian; Xiaodong Liang; Fengxia Liu (Appl. Math. Comput., 2018)

Super Rk-vertex-connectedness. - Xiaomin Hu; Yingzhi Tian; Jixiang Meng (Appl. Math. Comput., 2018)

Connectivity keeping stars or double-stars in 2-connected graphs. - Yingzhi Tian; Jixiang Meng; Hong-Jian Lai; Liqiong Xu (Discret. Math., 2018)

Strong matching preclusion for k-composition networks. - Xiaomin Hu; Yingzhi Tian; Xiaodong Liang; Jixiang Meng (Theor. Comput. Sci., 2018)

Vertex-connectivity and eigenvalues of graphs with fixed girth. - Ruifang Liu; Hong-Jian Lai; Yingzhi Tian; Yang Wu 007 (Appl. Math. Comput., 2019)

Equal relation between g-good-neighbor diagnosability under the PMC model and g-good-neighbor diagnosability under the MM∗ model of a graph. - Xiaomin Hu; Weihua Yang; Yingzhi Tian; Jixiang Meng (Discret. Appl. Math., 2019)

Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs. - Yingzhi Tian; Hong-Jian Lai; Liqiong Xu; Jixiang Meng (Discret. Math., 2019)

On the Sizes of Vertex-k-Maximal r-Uniform Hypergraphs. - Yingzhi Tian; Hong-Jian Lai; Jixiang Meng (Graphs Comb., 2019)

On the extremal sizes of maximal graphs without (k+1)-connected subgraphs. - Liqiong Xu; Hong-Jian Lai; Yingzhi Tian (Discret. Appl. Math., 2020)

Degree Sequence Conditions for Maximally Edge-Connected and Super Edge-Connected Hypergraphs. - Shuang Zhao; Yingzhi Tian; Jixiang Meng (Graphs Comb., 2020)

On the sizes of bi-k-maximal graphs. - Liqiong Xu; Yingzhi Tian; Hong-Jian Lai (J. Comb. Optim., 2020)

Cyclic vertex-connectivity of Cartesian product graphs. - Dejin Qin; Yingzhi Tian; Laihuan Chen; Jixiang Meng (Int. J. Parallel Emergent Distributed Syst., 2020)

The Connectivity of a Bipartite Graph and Its Bipartite Complementary Graph. - Yingzhi Tian; Huaping Ma; Liyun Wu (Parallel Process. Lett., 2020)

Conditional fractional matching preclusion of n-dimensional torus networks. - Xiaomin Hu; Yingzhi Tian; Jixiang Meng; Weihua Yang (Discret. Appl. Math., 2021)

Reliability evaluation of Modified bubble-sort graph networks based on structure fault pattern. - Na Wang; Jixiang Meng; Yingzhi Tian (Appl. Math. Comput., 2022)

Super Connected Direct Product of Graphs and Cycles. - Jiaqiong Yin; Yingzhi Tian (Axioms, 2022)

On forcibly k-connected and forcibly k-arc-connected digraphic sequences. - Xuemei Liu; Jixiang Meng; Yingzhi Tian (Discret. Appl. Math., 2022)

Connectivity keeping paths in k-connected bipartite graphs. - Lian Luo; Yingzhi Tian; Liyun Wu (Discret. Math., 2022)

The Extremal Sizes of Arc-Maximal (k, l)-Digraphs. - Liqiong Xu; Hong-Jian Lai; Yingzhi Tian; Murong Xu (Graphs Comb., 2022)

On the Number of Edges in a 3-Uniform Hypergraph with No (k + 1)-Connected Hypersubgraphs. - Qinglin Wang; Yingzhi Tian; Lihua Feng (J. Interconnect. Networks, 2022)

The g-Extra Connectivity of the Strong Product of Paths and Cycles. - Qinze Zhu; Yingzhi Tian (Symmetry, 2022)

Neighbor-connectivity of pancake networks and burnt pancake networks. - Na Wang; Jixiang Meng; Yingzhi Tian (Theor. Comput. Sci., 2022)

Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three. - Qing Yang; Yingzhi Tian (Discret. Math., 2023)

On the sizes of (k, l)-edge-maximal r-uniform hypergraphs. - Yingzhi Tian; Hong-Jian Lai; Jixiang Meng; Murong Xu (Discuss. Math. Graph Theory, 2023)

The Super Restricted Edge-connectedness of Direct Product Graphs. - Minglu Bai; Yingzhi Tian; Jiaqiong Yin (Parallel Process. Lett., 2023)

On forcibly k-edge-connected and forcibly super edge-connected uniform hypergraphic sequences. - Xuemei Liu; Jixiang Meng; Yingzhi Tian (J. Supercomput., 2023)

Extra connectivity of networks modeled by the strong product graphs. - Qinze Zhu; Yingzhi Tian (Appl. Math. Comput., 2024)

Reliability analyses of regular graphs based on edge-structure connectivity. - Na Wang; Jixiang Meng; Yingzhi Tian (Discret. Appl. Math., 2024)

Extremal spectral radius and essential edge-connectivity. - Yu Wang; Huiqiu Lin; Yingzhi Tian (Discret. Math., 2024)

Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs. - Qing Yang; Yingzhi Tian (Discret. Math., 2024)

The Restricted Edge-Connectivity of Strong Product Graphs. - Hazhe Ye; Yingzhi Tian (Axioms, 2024)

Characterizing the forbidden pairs for graphs to be super-edge-connected. - Hazhe Ye; Yingzhi Tian (AKCE Int. J. Graphs Comb., 2025)

Neighbor connectivity of hierarchical pancake networks. - Yu Fang; Yingzhi Tian (Appl. Math. Comput., 2025)

Exploring redundant trees in bipartite graphs. - Qing Yang; Yingzhi Tian (Appl. Math. Comput., 2025)

Proof of a conjecture on connectivity keeping odd paths in k-connected bipartite graphs. - Qing Yang; Yingzhi Tian (Discret. Math., 2025)

Component connectivity of hierarchical pancake graphs. - Hui Liu; Yingzhi Tian (J. Supercomput., 2025)

A survey on the vertex-(edge-)k-maximal graphs and the k-vertex-(edge-)connected graphs with redundant subgraphs. - Yingzhi Tian; Jixiang Meng (Discret. Appl. Math., 2026)