Area of research
Computer Networks and Communications · Computational Theory and Mathematics
Research interest
Research focused on Combinatorics and Vertex (graph theory), with related work in Conjecture, Hypercube, Stars. Notable publications include 'Reliability analysis of bijective connection networks in terms of the extra edge-connectivity', 'Equal relation between g -good-neighbor diagnosability under the PMC model and g -good-neighbor diagnosability under the MM<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML"...', and 'Connectivity keeping stars or double-stars in 2-connected graphs'.
Forcibly unicyclic and bicyclic graphic sequences
Extremal Problems for the Family of $k$-Strongly Connected Digraphs
ArXiv.org 2026cited by 0position: last
The h-Extra Edge-Connectivity of Hierarchical Pancake Graphs
Neighbor connectivity of hierarchical pancake networks
Component connectivity of hierarchical pancake graphs
A survey on the vertex-(edge-)<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e35" altimg="si22.svg"><mml:mi>k</mml:mi></mml:math>-maximal graphs and the <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e40" altimg="si22.svg"><mml:mi>k</mml:mi></mml:math>-vertex-(edge-)connected graphs with redundant subgraphs
On the Sizes of Bi-k-Edge-Maximal r-Uniform Hypergraphs
Extremal spectral radius and essential edge-connectivity
Extra connectivity of networks modeled by the strong product graphs
Connectivity keeping edges of trees in 3-connected or 3-edge-connected graphs
Exploring redundant trees in bipartite graphs
Reliability analyses of regular graphs based on edge-structure connectivity
The Restricted Edge-Connectivity of Strong Product Graphs
Graphs with a given conditional diameter that maximize the Wiener index
Characterizing the forbidden pairs for graphs to be super-edge-connected
On forcibly k-edge-connected and forcibly super edge-connected uniform hypergraphic sequences
The Super Restricted Edge-connectedness of Direct Product Graphs
On Forcibly k-Connected Uniform Hypergraphic Sequences
On Infinite Many Trees and Their Equienergetic Graphs
Reliability evaluation of Modified bubble-sort graph networks based on structure fault pattern
Neighbor-connectivity of pancake networks and burnt pancake networks
Connectivity keeping paths in k-connected bipartite graphs
Connectivity keeping caterpillars and spiders in bipartite graphs with connectivity at most three
The g-Extra Connectivity of the Strong Product of Paths and Cycles
On the Sizes of k-edge-maximal r-uniform Hypergraphs
On forcibly <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e48" altimg="si29.svg"><mml:mi>k</mml:mi></mml:math>-connected and forcibly <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e53" altimg="si29.svg"><mml:mi>k</mml:mi></mml:math>-arc-connected digraphic sequences
On the Number of Edges in a 3-Uniform Hypergraph with No (k + 1)-Connected Hypersubgraphs
The Extremal Sizes of Arc-Maximal (k, l)-Digraphs
Super Connected Direct Product of Graphs and Cycles
Conditional fractional matching preclusion of <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" display="inline" id="d1e60" altimg="si3.svg"><mml:mi>n</mml:mi></mml:math>-dimensional torus networks