Computing the Extremal Positive Definite Solutions of a Matrix Equation. - Xingzhi Zhan (SIAM J. Sci. Comput., 1996)

Inequalities for the Singular Values of Hadamard Products. - Xingzhi Zhan (SIAM J. Matrix Anal. Appl., 1997)

Inequalities for Unitarily Invariant Norms. - Xingzhi Zhan (SIAM J. Matrix Anal. Appl., 1998)

On the Unitary Orbit of Complex Matrices. - Fan Ding; Xingzhi Zhan (SIAM J. Matrix Anal. Appl., 2001)

Singular Values of Differences of Positive Semidefinite Matrices. - Xingzhi Zhan (SIAM J. Matrix Anal. Appl., 2001)

Linear Preservers That Permute the Entries of a Matrix. - Xingzhi Zhan (Am. Math. Mon., 2001)

The Sharp Rado Theorem for Majorizations. - Xingzhi Zhan (Am. Math. Mon., 2003)

Extremal Eigenvalues of Real Symmetric Matrices with Entries in an Interval. - Xingzhi Zhan (SIAM J. Matrix Anal. Appl., 2005)

Digraphs that have at most one walk of a given length with the same endpoints. - Zejun Huang; Xingzhi Zhan (Discret. Math., 2011)

Extremal digraphs whose walks with the same initial and terminal vertices have distinct lengths. - Zejun Huang; Xingzhi Zhan (Discret. Math., 2012)

The maximum girth and minimum circumference of graphs with prescribed radius and diameter. - Pu Qiao; Xingzhi Zhan (Discret. Math., 2018)

On Vertex Types of Graphs. - Pu Qiao; Xingzhi Zhan (Graphs Comb., 2018)

The Largest Graphs with Given Order and Diameter: A Simple Proof. - Pu Qiao; Xingzhi Zhan (Graphs Comb., 2019)

Pairs of a tree and a nontree graph with the same status sequence. - Pu Qiao; Xingzhi Zhan (Discret. Math., 2020)

The minimum number of Hamilton cycles in a Hamiltonian threshold graph of a prescribed order. - Pu Qiao; Xingzhi Zhan (J. Graph Theory, 2020)

Regular homogeneously traceable nonhamiltonian graphs. - Yanan Hu; Xingzhi Zhan (Discret. Appl. Math., 2022)

Every 3-connected claw-free graph with domination number at most 3 is hamiltonian-connected. - Petr Vrána; Xingzhi Zhan; Leilei Zhang (Discret. Math., 2022)

The maximum degree of a minimally hamiltonian-connected graph. - Xingzhi Zhan (Discret. Math., 2022)

The maximum size of a nonhamiltonian graph with given order and connectivity. - Xingzhi Zhan; Leilei Zhang (Discret. Math., 2023)

Graphs with Many Independent Vertex Cuts. - Yanan Hu; Xingzhi Zhan; Leilei Zhang (Graphs Comb., 2024)

The minimum number of detours in graphs. - Xingzhi Zhan (Australas. J Comb., 2024)

On the metric subgraphs of a graph. - Yanan Hu; Xingzhi Zhan (Ars Math. Contemp., 2025)

The minimum size and maximum diameter of an edge-pancyclic graph of a given order. - Chengli Li; Feng Liu; Xingzhi Zhan (Discret. Math., 2025)

Sparse graphs with an independent or foresty minimum vertex cut. - Kun Cheng; Yurui Tang; Xingzhi Zhan (Discret. Math., 2026)