Yingzhi Tian

EDBT 2026 Demo / reviewers in the wild / expert

dblp:32/7265 · DBLP profile ↗

← Back

18ranked-venue papers

3as first author

8since 2021 · last 2026

0000-0002-1595-9834ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 15 · 3 first-author · 6 since 2021Systems, architecture and hardware · 2 · 2 since 2021Databases, data management, data science and information retrieval · 2 · 1 first-author

Year	Publication	Venue	Position
2026	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.	1
2026	The 3-restricted edge-connectivity of the direct product graphs Yingzhi Tian	Discret. Appl. Math.	2
2025	Component connectivity of hierarchical pancake graphs Yingzhi Tian	J. Supercomput.	2
2024	Reliability analyses of regular graphs based on edge-structure connectivity Jixiang Meng, Yingzhi Tian	Discret. Appl. Math.	3
2023	On forcibly k-edge-connected and forcibly super edge-connected uniform hypergraphic sequences Jixiang Meng, Yingzhi Tian	J. Supercomput.	3
2022	On forcibly k-connected and forcibly k-arc-connected digraphic sequences Jixiang Meng, Yingzhi Tian	Discret. Appl. Math.	3
2022	Neighbor-connectivity of pancake networks and burnt pancake networks Jixiang Meng, Yingzhi Tian	Theor. Comput. Sci.	3
2021	Conditional fractional matching preclusion of n-dimensional torus networks Xiaomin Hu, Yingzhi Tian, Jixiang Meng, Weihua Yang	Discret. Appl. Math.	2
2020	On the extremal sizes of maximal graphs without (k+1)-connected subgraphs Liqiong Xu, Hong-Jian Lai, Yingzhi Tian	Discret. Appl. Math.	3
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.	3
2018	Strong matching preclusion for k-composition networks Xiaomin Hu, Yingzhi Tian, Xiaodong Liang, Jixiang Meng	Theor. Comput. Sci.	2
2017	Matching preclusion for k-ary n-cubes with odd k ≥ 3 Xiaomin Hu, Yingzhi Tian, Jixiang Meng	Discret. Appl. Math.	3
2017	Matching preclusion for n-dimensional torus networks Xiaomin Hu, Yingzhi Tian, Xiaodong Liang, Jixiang Meng	Theor. Comput. Sci.	2
2016	Strong matching preclusion for n-dimensional torus networks Xiaomin Hu, Yingzhi Tian, Xiaodong Liang, Jixiang Meng	Theor. Comput. Sci.	2
2014	The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree Weihua Yang, Yingzhi Tian, Hengzhe Li	Discret. Appl. Math.	2
2014	Reliability analysis of bijective connection networks in terms of the extra edge-connectivity Mingzu Zhang, Jixiang Meng, Weihua Yang, Yingzhi Tian	Inf. Sci.	4
2012	On the connectivity of p-diamond-free vertex transitive graphs Yingzhi Tian, Jixiang Meng, Zhao Zhang 0002	Discret. Appl. Math.	1
2009	lambdac-Optimally half vertex transitive graphs with regularity k Yingzhi Tian, Jixiang Meng	Inf. Process. Lett.	1