Ordering graphs with maximum degree 3 by their indices. - Kexiang Xu; Baogang Xu (Ars Comb., 2009)

On the Hosoya index and the Merrifield-Simmons index of graphs with a given clique number. - Kexiang Xu (Appl. Math. Lett., 2010)

The Zagreb indices of graphs with a given clique number. - Kexiang Xu (Appl. Math. Lett., 2011)

On Harary index of graphs. - Kexiang Xu; Kinkar Chandra Das (Discret. Appl. Math., 2011)

The Hosoya indices and Merrifield-Simmons indices of graphs with connectivity at most k. - Kexiang Xu; Jianxi Li; Lingping Zhong (Appl. Math. Lett., 2012)

Further results on the eccentric distance sum. - Hongbo Hua; Shenggui Zhang; Kexiang Xu (Discret. Appl. Math., 2012)

Trees with the seven smallest and eight greatest Harary indices. - Kexiang Xu (Discret. Appl. Math., 2012)

A note on the Kirchhoff index of bicyclic graphs. - Lihua Feng; Guihai Yu; Kexiang Xu; Zhengtao Jiang (Ars Comb., 2014)

Weighted Harary indices of apex trees and k-apex trees. - Kexiang Xu; Jinlan Wang; Kinkar Chandra Das; Sandi Klavzar (Discret. Appl. Math., 2015)

Extremal t-apex trees with respect to matching energy. - Kexiang Xu; Zhiqing Zheng; Kinkar Chandra Das (Complex., 2016)

Some extremal graphs with respect to inverse degree. - Kexiang Xu; Kinkar Chandra Das (Discret. Appl. Math., 2016)

Nordhaus-Gaddum-type results for resistance distance-based graph invariants. - Kinkar Chandra Das; Kexiang Xu; Yujun Yang (Discuss. Math. Graph Theory, 2016)

The number of spanning trees of a graph with given matching number. - Lihua Feng; Kexiang Xu; Kinkar Chandra Das; Aleksandar Ilic; Guihai Yu (Int. J. Comput. Math., 2016)

Ordering connected graphs by their Kirchhoff indices. - Kexiang Xu; Kinkar Chandra Das; Xiao-Dong Zhang 001 (Int. J. Comput. Math., 2016)

On two eccentricity-based topological indices of graphs. - Kexiang Xu; Yaser Alizadeh; Kinkar Chandra Das (Discret. Appl. Math., 2017)

Relations between total irregularity and non-self-centrality of graphs. - Kexiang Xu; Xiaoqian Gu; Ivan Gutman (Appl. Math. Comput., 2018)

On domination game stable graphs and domination game edge-critical graphs. - Kexiang Xu; Xia Li (Discret. Appl. Math., 2018)

On graphs with largest possible game domination number. - Kexiang Xu; Xia Li; Sandi Klavzar (Discret. Math., 2018)

Embeddings into almost self-centered graphs of given radius. - Kexiang Xu; Haiqiong Liu; Kinkar Chandra Das; Sandi Klavzar (J. Comb. Optim., 2018)

Extremal graphs for vertex-degree-based invariants with given degree sequences. - Muhuo Liu; Kexiang Xu; Xiao-Dong Zhang 001 (Discret. Appl. Math., 2019)

The general position number of Cartesian products involving a factor with small diameter. - Jing Tian; Kexiang Xu (Appl. Math. Comput., 2021)

Comparing Wiener complexity with eccentric complexity. - Kexiang Xu; Aleksandar Ilic; Vesna Irsic; Sandi Klavzar; Huimin Li (Discret. Appl. Math., 2021)

Constructing new families of transmission irregular graphs. - Kexiang Xu; Sandi Klavzar (Discret. Appl. Math., 2021)

The number of subtrees in graphs with given number of cut edges. - Kexiang Xu; Jie Li; Hua Wang 003 (Discret. Appl. Math., 2021)

Relating the total domination number and the annihilation number for quasi-trees and some composite graphs. - Hongbo Hua; Xinying Hua; Sandi Klavzar; Kexiang Xu (Discret. Math., 2022)

Comparative results between the number of subtrees and Wiener index of graphs. - Kexiang Xu; Jie Li; Zuwen Luo (RAIRO Oper. Res., 2022)

Mixed metric dimension of some graphs. - Kairui Nie; Kexiang Xu (Appl. Math. Comput., 2023)

On the Local and Global Mean Orders of Sub-$k$-Trees of $k$-Trees. - Zuwen Luo; Kexiang Xu (Electron. J. Comb., 2023)

On the mean subtree order of trees under edge contraction. - Zuwen Luo; Kexiang Xu; Stephan G. Wagner; Hua Wang 003 (J. Graph Theory, 2023)

The spectra of signed graphs obtained by $$ dot{H}$$-(generalized) join operation. - Yuying Li; Peikang Zhang; Kexiang Xu (Comput. Appl. Math., 2023)

Minimizing the number of edges in (Pk ∪ K3)-saturated connected graphs. - Yuying Li; Kexiang Xu (RAIRO Oper. Res., 2023)

Relating the annihilation number and the total domination number for some graphs. - Xinying Hua; Kexiang Xu; Hongbo Hua (Discret. Appl. Math., 2023)

Extremal problems for connected set enumeration. - Zuwen Luo; Kexiang Xu (Discret. Appl. Math., 2023)

New transmission irregular chemical graphs. - Kexiang Xu; Jing Tian; Sandi Klavzar (Discret. Appl. Math., 2023)

The number of connected sets in Apollonian networks. - Zuwen Luo; Kexiang Xu (Appl. Math. Comput., 2024)

Random subtrees and unimodal sequences in graphs. - Zuwen Luo; Kexiang Xu; Jing Tian (Discret. Math., 2024)

Computing the Number and Average Size of Connected Sets in Planar 3-Trees. - Zuwen Luo; Kexiang Xu (Graphs Comb., 2024)

The doubly metric dimensions of cactus graphs and block graphs. - Kairui Nie; Kexiang Xu (J. Comb. Optim., 2024)

On the number of F,4-saturating edges. - Yuying Li; Kexiang Xu (Appl. Math. Comput., 2025)

Resistance distances in generalized join graphs. - Shaohan Xu; Kexiang Xu (Discret. Appl. Math., 2025)