2 citations · 3 across the 23 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
math.CO2013
A lower bound of the least signless Laplacian eigenvalue of a graph
Shu-Guang Guo, Yong-Gao Chen, Guanglong Yu
Let be a simple connected graph on vertices and edges. In [Linear Algebra Appl. 435 (2011) 2570-2584], Lima et al. posed the following conjecture on the least eigenvalu…
math.CO2013
Distance spectral radius of a tree with given diameter
Guanglong Yu, Shuguang Guo, Mingqing Zhai
For a connected graph, the distance spectral radius is the largest eigenvalue of its distance matrix. In this paper, of all trees with both given order and fixed diameter, the tree…
math.CO2013
The domination number and the least -eigenvalue
Guanglong Yu, Shu-Guang Guo, Rong Zhang +1
A vertex set of a graph is said to be a dominating set if every vertex of is adjacent to at least a vertex in , and the domination number (,…