Yingzhi Tian

Orcid: 0000-0002-1595-9834

According to our database1, Yingzhi Tian authored at least 53 papers between 2009 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Exploring redundant trees in bipartite graphs.
Appl. Math. Comput., 2025

2024
The Restricted Edge-Connectivity of Strong Product Graphs.
Axioms, April, 2024

Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs.
Discret. Math., 2024

Extremal spectral radius and essential edge-connectivity.
Discret. Math., 2024

Reliability analyses of regular graphs based on edge-structure connectivity.
Discret. Appl. Math., 2024

Extra connectivity of networks modeled by the strong product graphs.
Appl. Math. Comput., 2024

2023
On forcibly k-edge-connected and forcibly super edge-connected uniform hypergraphic sequences.
J. Supercomput., September, 2023

The Super Restricted Edge-connectedness of Direct Product Graphs.
Parallel Process. Lett., September, 2023

On the sizes of (k, l)-edge-maximal r-uniform hypergraphs.
Discuss. Math. Graph Theory, 2023

Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three.
Discret. Math., 2023

2022
Neighbor-connectivity of pancake networks and burnt pancake networks.
Theor. Comput. Sci., 2022

The g-Extra Connectivity of the Strong Product of Paths and Cycles.
Symmetry, 2022

On the Number of Edges in a 3-Uniform Hypergraph with No (k + 1)-Connected Hypersubgraphs.
J. Interconnect. Networks, 2022

The Extremal Sizes of Arc-Maximal (k, l)-Digraphs.
Graphs Comb., 2022

Connectivity keeping paths in <i>k</i>-connected bipartite graphs.
Discret. Math., 2022

On forcibly k-connected and forcibly k-arc-connected digraphic sequences.
Discret. Appl. Math., 2022

Super Connected Direct Product of Graphs and Cycles.
Axioms, 2022

Reliability evaluation of Modified bubble-sort graph networks based on structure fault pattern.
Appl. Math. Comput., 2022

2021
Conditional fractional matching preclusion of n-dimensional torus networks.
Discret. Appl. Math., 2021

2020
The Connectivity of a Bipartite Graph and Its Bipartite Complementary Graph.
Parallel Process. Lett., 2020

Cyclic vertex-connectivity of Cartesian product graphs.
Int. J. Parallel Emergent Distributed Syst., 2020

On the sizes of bi-k-maximal graphs.
J. Comb. Optim., 2020

Degree Sequence Conditions for Maximally Edge-Connected and Super Edge-Connected Hypergraphs.
Graphs Comb., 2020

On the extremal sizes of maximal graphs without (k+1)-connected subgraphs.
Discret. Appl. Math., 2020

2019
On the Sizes of Vertex-k-Maximal r-Uniform Hypergraphs.
Graphs Comb., 2019

Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs.
Discret. Math., 2019

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., 2019

Vertex-connectivity and eigenvalues of graphs with fixed girth.
Appl. Math. Comput., 2019

2018
Strong matching preclusion for <i>k</i>-composition networks.
Theor. Comput. Sci., 2018

Connectivity keeping stars or double-stars in 2-connected graphs.
Discret. Math., 2018

Super <i>R<sup>k</sup></i>-vertex-connectedness.
Appl. Math. Comput., 2018

Connectivity of half vertex transitive digraphs.
Appl. Math. Comput., 2018

2017
Matching preclusion for n-dimensional torus networks.
Theor. Comput. Sci., 2017

Matching preclusion for k-ary n-cubes with odd k ≥ 3.
Discret. Appl. Math., 2017

2016
Strong matching preclusion for n-dimensional torus networks.
Theor. Comput. Sci., 2016

On the page number of triple-loop networks with even cardinality.
Ars Comb., 2016

Construction of super edge-connected multigraphs with prescribed degrees.
Ars Comb., 2016

2015
Restricted Connectivity for Some Interconnection Networks.
Graphs Comb., 2015

The Harary index of digraphs.
Ars Comb., 2015

cλ-optimally connected mixed Cayley graph.
Ars Comb., 2015

2014
Reliability analysis of bijective connection networks in terms of the extra edge-connectivity.
Inf. Sci., 2014

On restricted edge-connectivity of vertex-transitive multigraphs.
Int. J. Comput. Math., 2014

On the existence of super edge-connected graphs with prescribed degrees.
Discret. Math., 2014

The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree.
Discret. Appl. Math., 2014

On super connectedness and super restricted edge-connectedness of total graphs.
Ars Comb., 2014

On super restricted edge-connectivity of vertex-transitive graphs.
Ars Comb., 2014

2012
Inverse degree and super edge-connectivity.
Int. J. Comput. Math., 2012

On Super Restricted Edge Connectivity of Half Vertex Transitive Graphs.
Graphs Comb., 2012

On the connectivity of p-diamond-free vertex transitive graphs.
Discret. Appl. Math., 2012

2011
Superconnected and Hyperconnected Small Degree Transitive Graphs.
Graphs Comb., 2011

λ<sup>′</sup>-optimally connected mixed Cayley graphs.
Appl. Math. Lett., 2011

2010
On super restricted edge-connectivity of edge-transitive graphs.
Discret. Math., 2010

2009
lambda<sub>c</sub>-Optimally half vertex transitive graphs with regularity k.
Inf. Process. Lett., 2009


  Loading...