47 citations · 151 across the 69 of their papers we have counts for
70 papers
A class of trees determined by their chromatic symmetric functions
Yuzhenni Wang, Xingxing Yu, Xiao-Dong Zhang
Stanley introduced the concept of chromatic symmetric functions of graphs which extends and refines the notion of chromatic polynomials of graphs, and asked whether trees are deter…
On the -spectral radius of graphs without linear forests
Ming-Zhu Chen, A-Ming Liu, Xiao-Dong Zhang
Let and be the adjacency and degree matrices of a simple graph on vertices, respectively. The \emph{-spectral radius} of is the largest eigenvalue of…
On weighted spectral radius of unraveled balls and normalized Laplacian eigenvalues
Yuzhenni Wang, Xiao-Dong Zhang
For a graph , the unraveled ball of radius centered at a vertex is the ball of radius centered at in the universal cover of . We obtain a lower bound on the w…
The signless Laplacian spectral radius of graphs without trees
Ming-Zhu Chen, Zhao-Ming Li, Xiao-Dong Zhang
Let be the signless Laplacian matrix of a simple graph of order , where and are the degree diagonal matrix and the adjacency matrix of , respec…
Spectral extremal results on the -index of graphs without minors and star forests
Ming-Zhu Chen, A-Ming Liu, Xiao-Dong Zhang
Let be a graph of order , and let and be the adjacency matrix and the degree matrix of respectively. Define the convex linear combinations of $A (…
The bipartite Turan number and spectral extremum for linear forests
Ming-Zhu Chen, Ning Wang, Long-Tu Yuan +1
The bipartite Turán number of a graph , denoted by , is the maximum number of edges in any bipartite graph with and which does not conta…