Problem 10935. - Zhibing Chen (Am. Math. Mon., 2002)

A Higher Mean Value Theorem: 10935. - Zhibing Chen; Shusen Ding (Am. Math. Mon., 2003)

The formulas for the number of spanning trees in circulant graphs. - Min Li; Zhibing Chen; Xiaoqing Ruan; Xuerong Yong (Discret. Math., 2015)

Sufficient conditions on the zeroth-order general Randić index for maximally edge-connected graphs. - Zhibing Chen; Guifu Su; Lutz Volkmann (Discret. Appl. Math., 2017)

A preprocessed multi-step splitting iteration for computing PageRank. - Chuanqing Gu; Xianglong Jiang; Ying Nie; Zhibing Chen (Appl. Math. Comput., 2018)

Which cospectral graphs have same degree sequences. - Muhuo Liu; Yuan Yuan; Lihua You; Zhibing Chen (Discret. Math., 2018)

A GMRES-Power algorithm for computing PageRank problems. - Chuanqing Gu; Xianglong Jiang; Chenchen Shao; Zhibing Chen (J. Comput. Appl. Math., 2018)

Explicit solutions of the Yang-Baxter-like matrix equation for a diagonalizable matrix with spectrum contained in {1, α, 0}. - Dongmei Chen; Zhibing Chen; Xuerong Yong (Appl. Math. Comput., 2019)

The transfer matrices and the capacity of the 2-dimensional (1, ∞)-runlength limited constraint. - Zhibing Chen; Mordecai J. Golin; Xuerong Yong (Discret. Math., 2019)