2 citations · 2 across the 7 of their papers we have counts for
7 papers
On the sum of the largest -eigenvalues of graphs
Zhen Lin, Lianying Miao, Shuguang Guo
For every real , Nikiforov defined the -matrix of a graph as , where and are the adjacency matrix and the degree diago…
The domination number and the least Q-eigenvalue II
Guanglong Yu
Denote by the obtained by attaching a pendant path () to a cycle $\mathbb{C}=v_{1}v_{2}\cdots v_{g}v_…
Maxima of the signless Laplacian spectral radius for planar graphs
Guanglong Yu
The signless Laplacian spectral radius of a graph is the largest eigenvalue of its signless Laplacian. In this paper, we prove that the graph has the maximal…
Maxima of the -index for outer-planar graphs
Guanglong Yu
The - of graph is the largest eigenvalue of its signless Laplacian . In this paper, we prove that the graph has the maximal -ind…
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…
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…
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 (,…