2 citations · 2 across the 3 of their papers we have counts for
5 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.…
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…
A spectral characterization of the -clique extension of the triangular graphs
Ying-Ying Tan, Jack H. Koolen, Zheng-Jiang Xia
A regular graph is co-edge regular if there exists a constant such that any two distinct and non-adjacent vertices have exactly common neighbors. In this paper, we show tha…
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…