2 citations · 2 across the 5 of their papers we have counts for
6 papers
Connectivity and eigenvalues of graphs with given girth or clique number
Zhen-Mu Hong, Hong-Jian Lai, Zheng-Jiang Xia
Let , , and denote the edge-connectivity, vertex-connectivity, the algebraic connectivity and the Laplacian spectral radius of , respectively.…
Induced subgraphs of product graphs and a generalization of Huang's theorem
Zhen-Mu Hong, Hong-Jian Lai, Jian-Bing Liu
Recently, Huang showed that every -vertex induced subgraph of the -dimensional hypercube has maximum degree at least in [Annals of Mathematics, 190 (2019…
A note on the optimal rubbling in ladders and prisms
Zheng-Jiang Xia, Zhen-Mu Hong
A pebbling move on a graph G consists of the removal of two pebbles from one vertex and the placement of one pebble on an adjacent vertex. Rubbling is a version of pebbling where a…
Generalization of the cover pebbling number on trees
Zheng-Jiang Xia, Zhen-Mu Hong
A pebbling move on a graph consists of taking two pebbles off from one vertex and add one pebble on an adjacent vertex, the -pebbling number of a graph is the minimum number…
Sufficient conditions for graphs to be -connected, maximally connected and super-connected
Zhen-Mu Hong, Zheng-Jiang Xia, Fuyuan Chen +1
Let be a connected graph with minimum degree and vertex-connectivity . The graph is -connected if , maximally connected if , and su…
Vulnerability of super edge-connected graphs
Zhen-Mu Hong, Jun-Ming Xu
A subset of edges in a connected graph is a -extra edge-cut if is disconnected and every component has more than vertices. The -extra edge-connectivity $\la…