3 citations · 4 across the 4 of their papers we have counts for
4 papers
On distance spectral radius of power hypertrees with given number of pendant paths of fixed length
Yanna Wang, Xuli Qi
The distance spectral radius of a connected hypergraph is the largest eigenvalue of the distance matrix of the hypergraph. A pendant path of length l with l greater than or equal t…
A proof of a conjecture on the distance spectral radius
Yanna Wang, Bo Zhou
A cactus is a connected graph in which any two cycles have at most one common vertex. We determine the unique graph that maximizes the distance spectral radius over all cacti with…
A note on skew spectrum of graphs
Yanna Wang, Bo Zhou
We give some properties of skew spectrum of a graph, especially, we answer negatively a problem concerning the skew characteristic polynomial and matching polynomial in [M. Cavers…
A note on the minimum skew rank of a graph
Yanna Wang, Bo Zhou
The minimum skew rank of a graph over a field is the smallest possible rank among all skew symmetric matrices over , whose (,…