关键词:
Graph
The second largest signless Laplacian eigenvalue
Maximum degree
Second maximum degree
Nordhaus-Gaddum-type
摘要:
Let G be a simple graph of order n with m edges. Denote by D(G) the diagonal matrix of its vertex degrees and by A(G) its adjacency matrix. Then the signless Laplacian matrix of G is Q(G) = D(G) + A(G). Let q1 = q2 = center dot center dot center dot = qn be the signless Laplacian eigenvalues of graph G and also let. =.(G) (1 =. = n) be the largest positive integer such that q. = 2m/ n. Denote by G the complement graph of graph G. If G Kn, Kn, Kn- 1. K1, K1, n- 1, Kn - e, K2. (n 2) K1, then we prove that q2(G) + q2(G) = n - 1. Moreover, if G K1, n- 1, Kn- 1. K1, Kn - e, K2. (n - 2) K1, then (nu) over tilde +. >= 3.