47 citations · 151 across the 69 of their papers we have counts for
6 papers · 1 filter
Comparison of the upper bounds for the extreme points of the polytopes of line-stochastic tensors
Fuzhen Zhang, Xiao-Dong Zhang
We call a real multi-dimensional array a {\em tensor} for short. In enumerating vertices of the polytopes of stochastic tensors, different approaches have been used: {(1)} Combinat…
The Q-index and connectivity of graphs
Peng-Li Zhang, Lihua Feng, Weijun Liu +1
A connected graph is said to be -connected if it has more than vertices and remains connected whenever fewer than vertices are deleted. In this paper, for a connecte…
Lower bounds for the -spectral radius of uniform hypergraphs
Peng-Li Zhang, Xiao-Dong Zhang
For , the -spectral radius of a -uniform hypergraph is defined to be the spectral radius of the tensor $\mathcal{A}_α(G):=α\mathcal{D}(G)+(1-α) \m…
The signless Laplacian spectral radius of graphs without intersecting odd cycles
Ming-Zhu Chen, A-Ming Liu, Xiao-Dong Zhang
Let be a graph consisting of cycles of odd length , respectively which intersect in exactly a common vertex, where and $a_1\g…
On the spectral radius of graphs without a star forest
Ming-Zhu Chen, A-Ming Liu, Xiao-Dong Zhang
In this paper, we present two sharp upper bounds for the spectral radius of (bipartite) graphs with forbidden a star forest and characterize all extremal graphs. Moreover, the mini…
The Distance Energy of Clique Trees
Ya-Lei Jin, Rui Gu, Xiao-Dong Zhang
The distance energy of a simple connected graph is defined as the sum of absolute values of its distance eigenvalues. In this paper, we mainly give a positive answer to a conje…