default search action
Yingzhi Tian
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j53]Qing Yang, Yingzhi Tian:
Exploring redundant trees in bipartite graphs. Appl. Math. Comput. 486: 129006 (2025) - 2024
- [j52]Qinze Zhu, Yingzhi Tian:
Extra connectivity of networks modeled by the strong product graphs. Appl. Math. Comput. 477: 128825 (2024) - [j51]Hazhe Ye, Yingzhi Tian:
The Restricted Edge-Connectivity of Strong Product Graphs. Axioms 13(4): 231 (2024) - [j50]Na Wang, Jixiang Meng, Yingzhi Tian:
Reliability analyses of regular graphs based on edge-structure connectivity. Discret. Appl. Math. 356: 329-342 (2024) - [j49]Qing Yang, Yingzhi Tian:
Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs. Discret. Math. 347(5): 113913 (2024) - [j48]Yu Wang, Huiqiu Lin, Yingzhi Tian:
Extremal spectral radius and essential edge-connectivity. Discret. Math. 347(6): 113948 (2024) - 2023
- [j47]Qing Yang, Yingzhi Tian:
Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three. Discret. Math. 346(1): 113207 (2023) - [j46]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): 179-194 (2023) - [j45]Minglu Bai, Yingzhi Tian, Jiaqiong Yin:
The Super Restricted Edge-connectedness of Direct Product Graphs. Parallel Process. Lett. 33(3): 2350008:1-2350008:7 (2023) - [j44]Xuemei Liu, Jixiang Meng, Yingzhi Tian:
On forcibly k-edge-connected and forcibly super edge-connected uniform hypergraphic sequences. J. Supercomput. 79(14): 15980-15996 (2023) - 2022
- [j43]Na Wang, Jixiang Meng, Yingzhi Tian:
Reliability evaluation of Modified bubble-sort graph networks based on structure fault pattern. Appl. Math. Comput. 430: 127257 (2022) - [j42]Jiaqiong Yin, Yingzhi Tian:
Super Connected Direct Product of Graphs and Cycles. Axioms 11(6): 277 (2022) - [j41]Xuemei Liu, Jixiang Meng, Yingzhi Tian:
On forcibly k-connected and forcibly k-arc-connected digraphic sequences. Discret. Appl. Math. 321: 10-18 (2022) - [j40]Lian Luo, Yingzhi Tian, Liyun Wu:
Connectivity keeping paths in k-connected bipartite graphs. Discret. Math. 345(4): 112788 (2022) - [j39]Liqiong Xu, Hong-Jian Lai, Yingzhi Tian, Murong Xu:
The Extremal Sizes of Arc-Maximal (k, l)-Digraphs. Graphs Comb. 38(3): 72 (2022) - [j38]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): 2142020:1-2142020:7 (2022) - [j37]Qinze Zhu, Yingzhi Tian:
The g-Extra Connectivity of the Strong Product of Paths and Cycles. Symmetry 14(9): 1900 (2022) - [j36]Na Wang, Jixiang Meng, Yingzhi Tian:
Neighbor-connectivity of pancake networks and burnt pancake networks. Theor. Comput. Sci. 916: 31-39 (2022) - 2021
- [j35]Xiaomin Hu, Yingzhi Tian, Jixiang Meng, Weihua Yang:
Conditional fractional matching preclusion of n-dimensional torus networks. Discret. Appl. Math. 293: 157-165 (2021) - 2020
- [j34]Liqiong Xu, Hong-Jian Lai, Yingzhi Tian:
On the extremal sizes of maximal graphs without (k+1)-connected subgraphs. Discret. Appl. Math. 285: 397-406 (2020) - [j33]Shuang Zhao, Yingzhi Tian, Jixiang Meng:
Degree Sequence Conditions for Maximally Edge-Connected and Super Edge-Connected Hypergraphs. Graphs Comb. 36(4): 1065-1078 (2020) - [j32]Liqiong Xu, Yingzhi Tian, Hong-Jian Lai:
On the sizes of bi-k-maximal graphs. J. Comb. Optim. 39(3): 859-873 (2020) - [j31]Dejin Qin, Yingzhi Tian, Laihuan Chen, Jixiang Meng:
Cyclic vertex-connectivity of Cartesian product graphs. Int. J. Parallel Emergent Distributed Syst. 35(1): 81-90 (2020) - [j30]Yingzhi Tian, Huaping Ma, Liyun Wu:
The Connectivity of a Bipartite Graph and Its Bipartite Complementary Graph. Parallel Process. Lett. 30(3): 2040005:1-2040005:9 (2020)
2010 – 2019
- 2019
- [j29]Ruifang Liu, Hong-Jian Lai, Yingzhi Tian, Yang Wu:
Vertex-connectivity and eigenvalues of graphs with fixed girth. Appl. Math. Comput. 344-345: 141-149 (2019) - [j28]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: 96-103 (2019) - [j27]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): 344-351 (2019) - [j26]Yingzhi Tian, Hong-Jian Lai, Jixiang Meng:
On the Sizes of Vertex-k-Maximal r-Uniform Hypergraphs. Graphs Comb. 35(5): 1001-1010 (2019) - 2018
- [j25]Laihuan Chen, Jixiang Meng, Yingzhi Tian, Xiaodong Liang, Fengxia Liu:
Connectivity of half vertex transitive digraphs. Appl. Math. Comput. 316: 25-29 (2018) - [j24]Xiaomin Hu, Yingzhi Tian, Jixiang Meng:
Super Rk-vertex-connectedness. Appl. Math. Comput. 339: 812-819 (2018) - [j23]Yingzhi Tian, Jixiang Meng, Hong-Jian Lai, Liqiong Xu:
Connectivity keeping stars or double-stars in 2-connected graphs. Discret. Math. 341(4): 1120-1124 (2018) - [j22]Xiaomin Hu, Yingzhi Tian, Xiaodong Liang, Jixiang Meng:
Strong matching preclusion for k-composition networks. Theor. Comput. Sci. 711: 36-43 (2018) - 2017
- [j21]Xiaomin Hu, Bin Zhao, Yingzhi Tian, Jixiang Meng:
Matching preclusion for k-ary n-cubes with odd k ≥ 3. Discret. Appl. Math. 229: 90-100 (2017) - [j20]Xiaomin Hu, Yingzhi Tian, Xiaodong Liang, Jixiang Meng:
Matching preclusion for n-dimensional torus networks. Theor. Comput. Sci. 687: 40-47 (2017) - 2016
- [j19]Bin Zhao, Laihuan Chen, Yuepeng Zhang, Yingzhi Tian, Jixiang Meng:
On the page number of triple-loop networks with even cardinality. Ars Comb. 124: 257-266 (2016) - [j18]Xianglan Cao, Yingzhi Tian, Jixiang Meng:
Construction of super edge-connected multigraphs with prescribed degrees. Ars Comb. 127: 3-13 (2016) - [j17]Xiaomin Hu, Yingzhi Tian, Xiaodong Liang, Jixiang Meng:
Strong matching preclusion for n-dimensional torus networks. Theor. Comput. Sci. 635: 64-73 (2016) - 2015
- [j16]Luihuan Chen, Jixiang Meng, Yingzhi Tian:
cλ-optimally connected mixed Cayley graph. Ars Comb. 121: 3-17 (2015) - [j15]Haining Jiang, Jixiang Meng, Yingzhi Tian:
The Harary index of digraphs. Ars Comb. 123: 115-124 (2015) - [j14]Yingzhi Tian, Jixiang Meng:
Restricted Connectivity for Some Interconnection Networks. Graphs Comb. 31(5): 1727-1737 (2015) - 2014
- [j13]Yingzhi Tian, Jixiang Meng:
On super restricted edge-connectivity of vertex-transitive graphs. Ars Comb. 113: 211-223 (2014) - [j12]Yingzhi Tian, Jixiang Meng:
On super connectedness and super restricted edge-connectedness of total graphs. Ars Comb. 114: 309-319 (2014) - [j11]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: 304-309 (2014) - [j10]Yingzhi Tian, Jixiang Meng, Hong-Jian Lai, Zhao Zhang:
On the existence of super edge-connected graphs with prescribed degrees. Discret. Math. 328: 36-41 (2014) - [j9]Yingzhi Tian, Jixiang Meng:
On restricted edge-connectivity of vertex-transitive multigraphs. Int. J. Comput. Math. 91(8): 1655-1661 (2014) - [j8]Mingzu Zhang, Jixiang Meng, Weihua Yang, Yingzhi Tian:
Reliability analysis of bijective connection networks in terms of the extra edge-connectivity. Inf. Sci. 279: 374-382 (2014) - 2012
- [j7]Yingzhi Tian, Jixiang Meng, Zhao Zhang:
On the connectivity of p-diamond-free vertex transitive graphs. Discret. Appl. Math. 160(7-8): 1285-1290 (2012) - [j6]Yingzhi Tian, Jixiang Meng, Xiaodong Liang:
On Super Restricted Edge Connectivity of Half Vertex Transitive Graphs. Graphs Comb. 28(2): 287-296 (2012) - [j5]Yingzhi Tian, Litao Guo, Jixiang Meng, Chengfu Qin:
Inverse degree and super edge-connectivity. Int. J. Comput. Math. 89(6): 752-759 (2012) - 2011
- [j4]Yingzhi Tian, Jixiang Meng:
λ′-optimally connected mixed Cayley graphs. Appl. Math. Lett. 24(6): 872-877 (2011) - [j3]Yingzhi Tian, Jixiang Meng:
Superconnected and Hyperconnected Small Degree Transitive Graphs. Graphs Comb. 27(2): 275-287 (2011) - 2010
- [j2]Yingzhi Tian, Jixiang Meng:
On super restricted edge-connectivity of edge-transitive graphs. Discret. Math. 310(17-18): 2273-2279 (2010)
2000 – 2009
- 2009
- [j1]Yingzhi Tian, Jixiang Meng:
lambdac-Optimally half vertex transitive graphs with regularity k. Inf. Process. Lett. 109(13): 683-686 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint