共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
3.
4.
5.
Let G be a simple connected graph of order n with degree sequence d1,d2,…,dn in non-increasing order. The signless Laplacian spectral radius ρ(Q(G)) of G is the largest eigenvalue of its signless Laplacian matrix Q(G). In this paper, we give a sharp upper bound on the signless Laplacian spectral radius ρ(Q(G)) in terms of di, which improves and generalizes some known results. 相似文献
6.
Let S(Gσ) be the skew adjacency matrix of the oriented graph Gσ of order n and λ1,λ2,…,λn be all eigenvalues of S(Gσ). The skew spectral radius ρs(Gσ) of Gσ is defined as max{|λ1|,|λ2|,…,|λn|}. In this paper, we investigate oriented graphs whose skew spectral radii do not exceed 2. 相似文献
7.
8.
9.
10.
11.
12.
Denote by D(G)=(di,j)n×n the distance matrix of a connected graph G with n vertices, where dij is equal to the distance between vertices vi and vj in G . The least eigenvalue of D(G) is called the least distance eigenvalue of G , denoted by λn. In this paper, we determine all the graphs with λn∈[−2.383,0]. 相似文献
13.
14.
15.
16.
17.
18.
19.