Yingzhi Tian

From MaRDI portal
Person:287439

Available identifiers

zbMath Open tian.yingzhiMaRDI QIDQ287439

List of research outcomes





PublicationDate of PublicationType
Reliability analyses of regular graphs based on edge-structure connectivity2024-08-09Paper
Extremal spectral radius and essential edge-connectivity2024-04-30Paper
Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs2024-03-27Paper
Edge-connectivity keeping trees in $k$-edge-connected graphs2023-12-10Paper
The super restricted edge-connectedness of direct product graphs2023-11-10Paper
Characterizing the forbidden pairs for graphs to be super-edge-connected2023-09-02Paper
Extra Connectivity of Strong Product of Graphs2023-06-27Paper
https://portal.mardi4nfdi.de/entity/Q61623112023-06-15Paper
The super restricted edge-connectedness of direct product graphs2023-01-30Paper
On the sizes of \((k, l)\)-edge-maximal \(r\)-uniform hypergraphs2022-12-02Paper
Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three2022-11-02Paper
Connectivity of Cartesian product of hypergraphs2022-09-30Paper
On forcibly \(k\)-connected and forcibly \(k\)-arc-connected digraphic sequences2022-09-15Paper
The $g$-extra connectivity of the strong product of paths and cycles2022-08-17Paper
On the sizes of \(k\)-edge-maximal \(r\)-uniform hypergraphs2022-07-15Paper
The Connectivity of a Bipartite Graph and Its Bipartite Complementary Graph2022-07-08Paper
Reliability evaluation of modified bubble-sort graph networks based on structure fault pattern2022-06-21Paper
Neighbor-connectivity of pancake networks and burnt pancake networks2022-05-31Paper
Super connected direct product of graphs and cycles2022-05-10Paper
The extremal sizes of arc-maximal \((k, \ell)\)-digraphs2022-03-21Paper
Connectivity keeping paths in \(k\)-connected bipartite graphs2022-02-14Paper
https://portal.mardi4nfdi.de/entity/Q50173262021-12-17Paper
Conditional fractional matching preclusion of \(n\)-dimensional torus networks2021-03-25Paper
On the extremal sizes of maximal graphs without \(( k + 1 )\)-connected subgraphs2020-08-31Paper
Degree sequence conditions for maximally edge-connected and super edge-connected hypergraphs2020-06-24Paper
On the sizes of bi-\(k\)-maximal graphs2020-03-24Paper
https://portal.mardi4nfdi.de/entity/Q52063812019-12-18Paper
Vertex-connectivity and eigenvalues of graphs with fixed girth2019-11-25Paper
Super \(R^k\)-vertex-connectedness2019-11-22Paper
On the sizes of vertex-\(k\)-maximal \(r\)-uniform hypergraphs2019-11-06Paper
https://portal.mardi4nfdi.de/entity/Q51981802019-10-02Paper
Spanning tree packing number and eigenvalues of graphs with given girth2019-08-29Paper
Equal relation between \(g\)-good-neighbor diagnosability under the PMC model and \(g\)-good-neighbor diagnosability under the MM\(^\ast\) model of a graph2019-05-23Paper
Connectivity of half vertex transitive digraphs2019-04-29Paper
Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs2018-11-29Paper
Spanning tree packing, edge-connectivity and eigenvalues of graphs with given girth2018-08-18Paper
https://portal.mardi4nfdi.de/entity/Q31758252018-07-18Paper
https://portal.mardi4nfdi.de/entity/Q46411622018-05-25Paper
Connectivity keeping stars or double-stars in 2-connected graphs2018-02-23Paper
Strong matching preclusion for \(k\)-composition networks2018-02-16Paper
Matching preclusion for \(k\)-ary \(n\)-cubes with odd \(k \geq 3\)2017-07-27Paper
Matching preclusion for \(n\)-dimensional torus networks2017-06-13Paper
Reliability analysis of bijective connection networks in terms of the extra edge-connectivity2017-01-31Paper
https://portal.mardi4nfdi.de/entity/Q31800042017-01-06Paper
On the page number of triple-loop networks with even cardinality.2016-10-26Paper
The Harary index of digraphs.2016-10-26Paper
Construction of super edge-connected multigraphs with prescribed degrees.2016-10-26Paper
On the page number of lexicographic product of paths and cycles in books2016-10-06Paper
\(c\lambda\)-optimally connected mixed Cayley graph.2016-10-05Paper
https://portal.mardi4nfdi.de/entity/Q29907502016-08-10Paper
Embedding generalized Petersen graph in books2016-06-14Paper
Strong matching preclusion for \(n\)-dimensional torus networks2016-05-26Paper
Restricted connectivity for some interconnection networks2015-09-24Paper
https://portal.mardi4nfdi.de/entity/Q49829352015-04-13Paper
https://portal.mardi4nfdi.de/entity/Q51717522015-02-11Paper
https://portal.mardi4nfdi.de/entity/Q29367122015-01-06Paper
On restricted edge-connectivity of vertex-transitive multigraphs2014-12-29Paper
On reliability of hypercubes in terms of extra edge-connectivity2014-11-03Paper
On the existence of super edge-connected graphs with prescribed degrees2014-05-06Paper
The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree2014-03-27Paper
https://portal.mardi4nfdi.de/entity/Q53998732014-02-28Paper
https://portal.mardi4nfdi.de/entity/Q53990372014-02-28Paper
Inverse degree and super edge-connectivity2013-01-22Paper
On super restricted edge connectivity of half vertex transitive graphs2012-12-27Paper
On the connectivity of \(p\)-diamond-free vertex transitive graphs2012-05-30Paper
https://portal.mardi4nfdi.de/entity/Q31150642012-02-20Paper
Superconnected and hyperconnected small degree transitive graphs2012-01-24Paper
https://portal.mardi4nfdi.de/entity/Q30166232011-07-19Paper
https://portal.mardi4nfdi.de/entity/Q30166242011-07-19Paper
\(\lambda ^{\prime}\)-optimally connected mixed Cayley graphs2011-04-05Paper
On super restricted edge-connectivity of edge-transitive graphs2010-10-11Paper
\(\lambda _c\)-Optimally half vertex transitive graphs with regularity \(k\)2010-08-20Paper
https://portal.mardi4nfdi.de/entity/Q34036862010-02-12Paper
Proof a conjecture on connectivity keeping odd paths in k-connected bipartite graphsN/APaper
WITHDRAWN: Connectivity keeping trees in 3-connected bipartite graphs with girth conditionsN/APaper
The Restricted Edge-Connectivity of Strong Product GraphsN/APaper
Graphs with a given conditional diameter that maximize the Wiener indexN/APaper

Research outcomes over time

This page was built for person: Yingzhi Tian