|
|
- Emma Kelley
- 6 years ago
- Views:
Transcription
1 This article was originally published in a journal published by Elsevier, and the attached copy is provided by Elsevier for the author s benefit and for the benefit of the author s institution, for non-commercial research and educational use including without limitation use in instruction at your institution, sending it to specific colleagues that you know, and providing a copy to your institution s administrator. All other uses, reproduction and distribution, including without limitation commercial reprints, selling or licensing copies or access, or posting on open internet sites, your personal or institution s website or repository, are prohibited. For exceptions, permission may be sought for such use through Elsevier s permissions site at:
2 Linear Algebra and its Applications 4 ( Bounds on the (Laplacian spectral radius of graphs Abstract Lingsheng Shi Department of Mathematical Sciences, Tsinghua University, Beijing , China Received 8 October 005; accepted 1 December 006 Available online 31 January 007 Submitted by R.A. Brualdi The spectral radius of a graph is the largest eigenvalue of adjacency matrix of the graph and its Laplacian spectral radius is the largest eigenvalue of the Laplacian matrix which is the difference of the diagonal matrix of vertex degrees and the adjacency matrix. Some sharp bounds are obtained for the (Laplacian spectral radii of connected graphs. As consequences, some (sharp upper bounds of the Nordhaus Gaddum type are also obtained for the sum of (Laplacian spectral radii of a connected graph and its connected complement. 006 Elsevier Inc. All rights reserved. AMS classification: 05C50; 15A4 Keywords: Spectral radius; Laplacian spectral radius; Nordhaus Gaddum type 1. Introduction The graphs in this paper are undirected and simple without loops and multiple edges. Let G = (V, E be a simple undirected graph. The complement G c of the graph G is the graph with the same set of vertices as G, where two distinct vertices are adjacent if and only if they are independent in G.Forv V, the degree of v, denoted by d(v = d G (v, is the number of edges incident to v. We denote by Δ(G and δ(g the maximum degree and minimum degree of vertices of G, respectively. A graph is d-regular if Δ(G = δ(g = d. Let u, v V.Awalk of G from u to v is a finite alternating sequence v 0 (= ue 1 v 1 e v k 1 e k v k (= v of vertices and edges such that e i = v i 1 v i for i = 1,,...,k. The number k is the length of the walk. In particular, if the vertex v i,i = 0, 1,...,k in the walk are all distinct then the walk is called a path. The distance of u and v is the length of the shortest path between u and v. The diameter d(g of G is the maximum distance over all pairs of vertices. address: lshi@math.tsinghua.edu.cn /$ - see front matter ( 006 Elsevier Inc. All rights reserved. doi: /j.laa
3 756 L. Shi / Linear Algebra and its Applications 4 ( Let A be a square matrix. The spectral radius ρ(a of A is the maximum eigenvalue of A. Let A(G be the adjacency matrix of a graph G and D(G = diag(d(v 1, d(v,...,d(v n be the diagonal matrix of vertex degrees. The Laplacian matrix of G is L(G = D(G A(G. The spectral radius ρ(g of G is the maximum eigenvalue of the adjacency matrix A(G and the Laplacian spectral radius μ(g of G is the maximum eigenvalue of the Laplacian matrix L(G. Since A(G is nonnegative, the Perron Frobenius Theorem implies that ρ(g is associated to a nonnegative eigenvector. Moreover, if G is connected, then A(G is irreducible and thus the Perron Frobenius Theorem implies that ρ(g is simple and is associated to a positive eigenvector. The Geršgorin disc theorem implies that L(G is positive semidefinite and hence its eigenvalues are all nonnegative. We study the (Laplacian spectral radius of graphs in this paper. Many upper bounds on the (Laplacian spectral radius of graphs have been obtained up to now. We will give some corresponding lower bounds and also state simpler proofs for some known upper bounds. This paper is organized as follows. In Section, we will give some sharp bounds on the spectral radius of connected graphs and some sharp upper bounds of the Nordhaus Gaddum type on the sum of spectral radii of a connected graph and its connected complement In Section 3, we will give some sharp bounds on the Laplacian spectral radius of connected graphs and an upper bound of the Nordhaus Gaddum type. Now we introduce some lemmas which will be used later on. Lemma 1.1 [9]. Let A be a nonnegative symmetric matrix and x be a unit vector. If ρ(a = x T Ax, then Ax = ρ(ax. Let B be a matrix. Denote by s i (B the ith row sum of B. The proof of Lemma.1 in [5] implies the following slightly stronger version. Lemma 1.. Let B be a real symmetric n n matrix, and let λ be an eigenvalue of B with an eigenvector x all of whose entries are nonnegative. Then min s i(b λ max s i(b. 1 i n 1 i n Moveover, if all entries of x are positive then either of the equalities holds if and only if the row sums of B are all equal. Lemma 1.3. Let B be a real symmetric n n matrix, and let λ be an eigenvalue of B with an eigenvector x whose entries are all nonnegative. Let p be any polynomial. Then min s i(p(b p(λ max s i(p(b. 1 i n 1 i n Moveover, if all entries of x are positive then either of the equalities holds if and only if the row sums of p(b are all equal. Proof. This follows from Lemma 1. by noting that p(b has x as an eigenvector for the eigenvalue p(λ.. The spectral radius In this section, we study the spectral radius of graphs. We will state some known upper bounds on the spectral radius of graphs and give the corresponding lower bounds. The simpler proofs for upper bounds are also stated.
4 .1. Bounds on the spectral radius L. Shi / Linear Algebra and its Applications 4 ( Theorem.1. Let G = (V, E be a graph. Then ( 1/ ( 1/ d(u ρ(g max d(u. min Moreover, if G is connected then either of the equalities holds if and only if d(u is the same for all v V. The upper bound in Theorem.1 is due to Favaron et al. [6], see also Cao []. Proof. Note that s v (A is exactly the number of walks of length in G with an end at v. This equals the sum of degree of u over all u with uv E. IfGis connected, then the nonnegative adjacency matrix A of G is irreducible. The Perron Frobenius Theorem guarantees that the spectral radius ρ(g is associated to a positive eigenvector. Then the conclusion follows from Lemma 1.3. Corollary.1. Let G be a graph with n vertices,medges and no isolated vertex. Let Δ = Δ(G and δ = δ(g. Then (m Δn + Δδ + Δ δ 1/ ρ(g (m δn + Δδ Δ + δ 1/. Moreover, if G is connected then the first equality holds if and only if G is regular and the second holds if and only if G is a regular graph or a star. The upper bound in Corollary.1 is due to Cao [], see also Das et al. [4]. Proof. Theorem.1 gives that ρ(g min d(u (G = min (G min (G (G m d(v 1/ uv / E(G d(u 1/ [m d(v (n d(v 1Δ]1/ = min [m + (Δ 1d(v Δ(n 1]1/ (G [m + (Δ 1δ Δ(n 1] 1/ = (m Δn + Δδ + Δ δ 1/. If ρ(g attains the lower bound then all equalities in the argument must hold. Now if G is connected then A(G is irreducible and the Perron Frobenius Theorem implies that ρ(g is associated to a positive eigenvector. Lemma 1.3 implies that for all v V (G, d(u = (n d(v 1Δ. uv / E(G
5 758 L. Shi / Linear Algebra and its Applications 4 ( Hence either d(v = n 1ord(u = Δ, for all u with uv / E(G. This shows that the graph G is regular. Conversely if G is d-regular then clearly (G d(u = d for all v V (G and thus ρ(g attains the lower bound. Similarly for the upper bound, we have 1/ ρ(g max d(u (G = max (G (G m d(v uv / E(G d(u 1/ max (G 1δ]1/ (1 = max (G 1]1/ ( [m + (δ 1Δ δ(n 1] 1/ = (m δn + Δδ Δ + δ 1/. If ρ(g attains the upper bound then all equalities in the argument must hold. Now if G is connected then ρ(g is associated to a positive eigenvector and thus Lemma 1.3 with (1 implies that for all v V (G, d(u = (n d(v 1δ. uv / E(G Hence either d(v = n 1ord(u = δ, for all u with uv / E(G. Ifd(v = n 1 for some v then by ( wehaved(u = n 1or1foru V (G v. Thus G is a star or a regular graph. Conversely if G is regular then clearly ρ(g attains the upper bound. Now let G be a star. If d(v = n 1 then d(u = 1 = n 1. (G (G If d(v = 1 then d(u = n 1. (G Thus (G d(u = n 1 for all v V (G and hence ρ(g attains the upper bound. Theorem.. Let G be a graph with n vertices and m edges. Let Δ = Δ(G and δ = δ(g. If Δ < n 1 [(n 1 8m 1] 1/, then ρ(g 1 ( Δ 1 (Δ (m Δn (3 or 1 ( Δ 1 + (Δ (m Δn ρ(g 1 ( δ 1 + (δ (m δn. (4
6 L. Shi / Linear Algebra and its Applications 4 ( Moreover, if G is connected, then the upper bound in (3 is strict, the first equality in (4 holds if and only if G is regular, and the second in (4 holds if and only if G is either a regular graph or a bidegreed graph with all vertices of degree δ or n 1. The upper bound in (4 for connected graphs is due to Hong et al. [8]. Proof. Note that s v (A = d(v for all v V (G. By the proof of Theorem.1, we have for all v V (G, s v (A = d(u = m d(v d(u m d(v (n d(v 1Δ (G uv / E(G = m + (Δ 1d(v Δ(n 1 = m + (Δ 1s v (A Δ(n 1. Hence s v [A (Δ 1A] m Δ(n 1. This with Lemma 1.3 implies that ρ(g (Δ 1ρ(G m Δ(n 1. Solving this quadratic inequality, we obtain that if Δ < n 1 [(n 1 8m 1] 1/ then ρ(g 1 ( Δ 1 (Δ (m Δn or ρ(g 1 ( Δ 1 + (Δ (m Δn. Either of the two equalities holds implies that all equalities in the argument must hold. As in the proof of Corollary.1, ifg is connected then G is regular. Conversely, if G is d-regular, then ρ(g = d attains the lower bound. This also implies that for connected graph G the upper bound in (3 can never be attained. Theorem.3. Let G = (V, E be a connected graph with m edges. Then ρ(g ( / 1/ d(u (m. The equality holds if and only if d(u/d(v is the same for all v V or G is a bipartite graph and d(u/d(v is the same for all v in the same part of G. Proof. Let A be the adjacency matrix of G and c = ( d(v v / m a positive unit column vector. Then ( / m. Ac = d(u v Since G is connected, A is irreducible. The Perron Frobenius Theorem implies that ρ(g is simple. By Rayleigh s principle, we have that ρ(g ( / 1/ d(u (m.
7 760 L. Shi / Linear Algebra and its Applications 4 ( If the equality holds, then ρ(a = c T A c. By Lemma 1.1, wehavea c = ρ(a c. If the multiplicity of ρ(a is one, then c is also an eigenvector of ρ(g. This implies that d(u = ρ(g d(v, i.e. d(u/d(v = ρ(g. Otherwise the multiplicity of ρ(a = ρ(a is two. This implies that ρ(g is also an eigenvalue of G. Then G is a connected bipartite graph (cf. Theorem 3.4 in [3]. Thus we may assume that ( 0 B A = B T, 0 where B is an n 1 n matrix with n 1 + n = n. We write correspondingly c = c where c 1 is an n 1 -vector and c is an n -vector. Since ( A BB T 0 = 0 B T, B we have BB T c 1 = ρ(a c 1 and B T Bc = ρ(a c. Noting that BB T and B T B have the same nonzero eigenvalues, ρ(a is the spectral radius of BB T and its multiplicity is one. Since BB T Bc = Bρ(A c = ρ(a Bc, we have that Bc is also an eigenvector of BB T for ρ(a and hence Bc = p 1 c 1 where p 1 is a scalar. This implies that for all v in the part of order n 1,wehave d(u/d(v = p1. Similarly we may obtain that Bc 1 = p c where p is a scalar. This implies that for all v in the part of order n,wehave d(u/d(v = p. Conversely, if for all v, d(u/d(v = p, then Ac = pc. It is well known that any positive eigenvector of a nonnegative matrix is of the spectral radius of the matrix. Hence ρ(g = p = ( / 1/ d(u (m. Now assume that G = (U, W; E is a bipartite graph with U =n 1, W =n and its adjacency matrix ( 0 B A = B T, where B = (b 0 uv is an n 1 n matrix ( c1
8 and for all v U, d(u/d(v = p1 ; for all v W, d(u/d(v = p. L. Shi / Linear Algebra and its Applications 4 ( Let c 1 = ( d(v v U and c = ( d(v v W. Then for each v U, the vth element of BB T c 1 is r v (BB T c 1 = b vw b uw d(u = b vw b uw d(u u U w W w W u U = b vw p d(w = p1 p d(v. w W Similarly, r u (B T Bc = p 1 p d(u, for all u W. Hence A c = p 1 p c where c = c / m. Since any positive eigenvector of a nonnegative matrix is of the spectral radius of the matrix, we have ρ(a = p 1 p = c T A c. It follows that ( / 1/ ρ(g = c T A c = d(u (m. Remark. Theorem.3 is analogous to Theorem 4 in [0] and Theorem 3.1 in [9]. A more general theorem of this type may be found in the recent paper [15]... Bounds of the Nordhaus Gaddum type Nordhaus and Gaddum [16] first studied the sum of the chromatic number of a graph G and its complement G c. Let G be a graph of order n. Nosal [17] gave a sharp lower bound and an upper bound on the spectral radius ρ(g of adjacency matrix A(G of the Nordhaus Gaddum type: n 1 ρ(g + ρ(g c (n 1. Let Δ = Δ(G and δ = δ(g. Li[11] proved that ρ(g + ρ(g c 1 + n(n 1 4δ(n 1 Δ 1. Here, we give some sharp upper bounds on the spectral radius of the Nordhaus Gaddum type for a connected graph G and its connected complement G c. Theorem.4. Let G be a graph of order n with 0 < δ(g Δ(G<n 1. Then ρ(g + ρ(g c [(n 1 δn + Δδ Δ + 3δ]. Moreover, if both G and G c are connected, then the equality holds if and only if G is (n 1/-regular. ( c1 Proof. Let f (m, Δ,δ= (m δn + Δδ Δ + δ 1/. Note that Δ(G c = n 1 δ, δ(g c = n 1 Δ and m(g c = m. Corollary.1 gives that ( n
9 76 L. Shi / Linear Algebra and its Applications 4 ( (( ρ(g f (m, Δ,δ and ρ(g c n f m, n 1 δ, n 1 Δ. (( Now let g(m = f (m, Δ,δ+ f n m, n 1 δ, n 1 Δ. Then ρ(g + ρ(g c g(m. Since (( dg n dm = 1/f (m, Δ,δ 1/f m, n 1 δ, n 1 Δ, (( it is easy to check that dg dm 0 if and only if f (m, Δ,δ f n m, n 1 δ, n 1 Δ i.e. m [(n 1 + Δ + δ]/4. Thus ρ(g + ρ(g c g([(n 1 + Δ + δ]/4 = f([(n 1 + Δ + δ]/4, Δ,δ = [(n 1 δn + Δδ Δ + 3δ]. If the sum of spectral radii attains the upper bound, then the spectral radii of G and G c both attain their upper bounds and m =[(n 1 + Δ + δ]/4. Now if both G and G c are connected, then Corollary.1 implies that Δ = δ. Thus δn = (n 1 + δ. This implies that δ = (n 1/ and hence G is (n 1/-regular. Conversely, if G is (n 1/-regular, then ρ(g + ρ(g c = n 1. Theorem.5. Let G be a graph of order n. Then ρ(g + ρ(g c { n Δ + δ 3 + [(n Δ + 4n(Δ δ + (δ + 1 ] } /. Moreover, if both G and G c are connected, then the equality holds if and only if G is (n 1/-regular. Proof. Let f (m, Δ,δ=[(δ (m δn] 1/. Note that Δ(G c = n 1 δ, δ(g c = n 1 Δ and m(g c = ( n m. Theorem. gives that ρ(g [δ 1 + f (m, Δ,δ]/ and [ (( ρ(g c n / n Δ + f m, n 1 δ, n 1 Δ]. (( Now let g(m = f (m, Δ,δ+ f n m, n 1 δ, n 1 Δ. Then ρ(g + ρ(g c [n Δ + δ 3 + g(m]/. Since (( dg n dm = 4/f (m, Δ,δ 4/f m, n 1 δ, n 1 Δ, (( it is easy to check that dg dm 0 if and only if f (m, Δ,δ f n m, n 1 δ, n 1 Δ i.e. m [(n Δ + 4n(Δ + δ (δ + 1 ]/16. Thus
10 L. Shi / Linear Algebra and its Applications 4 ( ρ(g + ρ(g c {n Δ + δ 3 + g([(n Δ + 4n(Δ + δ (δ + 1 ]/16}/ ={n Δ + δ 3 + f([(n Δ + 4n(Δ + δ (δ + 1 ]/16, Δ,δ}/ ={n Δ + δ 3 + [(n Δ + 4n(Δ δ + (δ + 1 ]}/. If the sum of spectral radii attains the upper bound, then the spectral radii of G and G c both attain their upper bounds and m =[(n Δ + 4n(Δ + δ (δ + 1 ]/16. Now if both G and G c are connected, then Theorem. implies that Δ = δ. Thus 8δn = (n δ + 8δn (δ + 1. This implies that δ = (n 1/ and hence G is (n 1/-regular. Conversely, if G is (n 1/-regular, then ρ(g + ρ(g c = n 1. Remark. It is easy to see that our upper bounds are incomparable to the bounds of Nosal and Li. However, if Δ = o(n or δ = n o(n, then Theorem.5 implies that ρ(g + ρ(g c = O(( + 1n/ which is better than the bounds O( n of Nosal and Li and of Theorem The Laplacian spectral radius In this section, we study the Laplacian spectral radius of graphs Bounds on the Laplacian spectral radius Bounds by degrees In this section, We will state some known upper bounds on the Laplacian spectral radius of graphs and give the corresponding lower bounds for bipartite graphs. The simpler proofs for upper bounds are also stated. An upper bound for irregular graphs will be given in the end. Let G be a graph with the degree diagonal matrix D(G and the adjacency matrix A(G. Let Q(G = D(G + A(G. Then Q is nonnegative and hence the Perron Frobenius Theorem guarantees that the spectral radius ρ(q of Q is associated to a nonnegative eigenvector. Lemma 3.1 [3]. Let G be a graph. Then μ(g ρ(q. Moreover, if G is connected then the equality holds if and only if G is a bipartite graph. Theorem 3.1. Let G = (V, E be a graph. Then μ(g ( max d(v + 1/ d(u. Moreover, if G is connected then the equality holds if and only if G is bipartite and d(v + d(u is the same for all v V.In particular, if G is bipartite then μ(g ( min d(v + 1/ d(u. Moreover, if G is connected then the equality holds if and only if d(v + d(u is the same for all v V.
11 764 L. Shi / Linear Algebra and its Applications 4 ( Proof. Since s v (Q = d(v and s v (AD = s v (A = d(u, wehave s v (Q = s v (DQ + AD + A = d(vs v (Q + d(u = d(v + Lemma 3.1 and Lemma 1.3 imply that μ(g ρ(q ( max d(v + d(u 1/ d(u. and for connected graph G, the equality holds if and only if G is bipartite and d(v + d(u is the same for all v V. If G is bipartite then D A and D + A have the same eigenvalues and D + A is a nonnegative irreducible symmetric matrix. The Perron Frobenius Theorem and Lemma 1.3 imply that μ(g = ρ(q ( min d(v + 1/ d(u, and for connected graph G, the equality holds if and only if d(v + d(u is the same for all v V. Corollary 3.1. Let G be a graph with n vertices,medges and no isolated vertex. Let Δ = Δ(G and δ = δ(g. Then μ(g [Δ + 4m δ(n 1 + Δ(δ 1] 1/. Moreover, if G is connected then the equality holds if and only if G is a regular bipartite graph. In particular, if G is bipartite then μ(g [δ + 4m Δ(n 1 + δ(δ 1] 1/. Moreover, if G is connected then the equality holds if and only if G is regular. The upper bound in Corollary 3.1 is due to Li et al. [10]. Proof. Theorem 3.1 gives that μ(g max d(v + max (G (G (G d(u Δ + m d(v 1/ uv / E(G d(u 1/ max (G [Δ + 4m d(v (n d(v 1δ] 1/ = max (G [Δ + 4m + (δ 1d(v δ(n 1] 1/ [Δ + 4m δ(n 1 + Δ(δ 1] 1/. The equality holds if and only if all equalities in the argument hold. This implies that for connected graph G, μ(g attains the upper bound if and only if G is a regular bipartite graph.
12 L. Shi / Linear Algebra and its Applications 4 ( Similarly, if G is bipartite then we have μ(g min min (G (G d(v + (G d(u δ + m d(v 1/ uv / E(G d(u min (G [δ + 4m d(v (n d(v 1Δ] 1/ = min (G [δ + 4m + (Δ 1d(v Δ(n 1] 1/ [δ + 4m Δ(n 1 + δ(δ 1] 1/. For connected graph G, the equality holds if and only if G is regular. Theorem 3.. Let G be a bipartite graph with n vertices and m edges. Let Δ = Δ(G and δ = δ(g. Then or μ(g {Δ + δ 1 [(Δ + δ 1 + 8(m Δn + Δ] 1/ }/ (5 {Δ + δ 1 +[(Δ + δ 1 + 8(m Δn + Δ] 1/ }/ μ(g {Δ + δ 1 +[(Δ + δ 1 + 8(m δn + δ] 1/ }/. (6 Moreover, if G is connected then the upper bound in (5 is strict, and either of the equalities in (6 holds if and only if G is regular. The upper bound in (6 of Theorem 3. is due to Liu et al. [13]. Proof. As in the proof of Theorem 3.1, wehave s v (Q = d(v + d(u (G = d(vs v (Q + m d(v uv / E(G d(u δs v (Q + 4m d(v (n d(v 1Δ = 4m + s v (Q(Δ + δ 1 Δ(n 1. Hence for each v V (G, we obtain 1/ s v [Q (Δ + δ 1Q] 4m Δ(n 1. Then Lemma 1.3 with μ(g = ρ(q implies that μ(g (Δ + δ 1μ(G 4m Δ(n 1.
13 766 L. Shi / Linear Algebra and its Applications 4 ( Solving the quadratic inequality, we obtain μ(g {Δ + δ 1 [(Δ + δ 1 + 8(m Δn + Δ] 1/ }/ or μ(g {Δ + δ 1 +[(Δ + δ 1 + 8(m Δn + Δ] 1/ }/. Either of the above equalities holds implies that all equalities in the argument must hold. For connected graph G, Lemma 1.3 implies that for all v V (G, d(u = (n d(v 1Δ. uv / E(G Hence either d(v = n 1ord(u = Δ, for all u with uv E(G. This shows that the graph G is regular. Conversely, if G is d-regular then μ(g = d attains the lower bound. This also implies that for connected graph G the upper bound in (5 can never be attained. Theorem 3.3. Let G = (V, E be a connected bipartite graph with m edges. Then μ(g ( d(v 3/ + / 1/ d(u (m. The equality holds if and only if G is regular. Proof. Let A be the adjacency matrix of G and D be the diagonal matrix of degrees. Let Q = D + A and c = ( d(v v / m a positive unit column vector. Then ( Qc = d(v 3/ + / m. d(u v Note that Q is nonnegative and irreducible. The Perron Frobenius Theorem implies that ρ(q is simple. By Rayleigh s principle, we have that μ(g = ρ(q ( d(v 3/ + / 1/ d(u (m. If the equality holds, then ρ(q = c T Q c. By Lemma 1.1,wehaveQ c = ρ(q c. Since Q is a positive semidefinite matrix and ρ(q = ρ(q, the multiplicity of ρ(q is one. Thus c is also an eigenvector of ρ(q. This implies that for all v V, d(v 3/ + d(u = μ(g d(v, i.e. d(v + d(u/d(v = μ(g. Then Δ + Δδ μ(g δ + Δδ. Thus Δ = δ and hence G is regular. Conversely, if G is d-regular then d(v 3/ + d(u = d 3/.
14 It follows that μ(g = d = L. Shi / Linear Algebra and its Applications 4 ( ( d(v 3/ + / d(u (m 1/. Remark. Theorem 3.3 is analogous to Theorem 9 in [0] which gives the following lower bound on the spectral radius of a bipartite connected graph G = (V, E: μ(g ( d(v + / d(u d(v with equality if and only if d(u/d(v is the same for all v V in the same part of G. However, it is easy to see that they are incomparable. The spectral radius of a d-regular graph is d with (1, 1,...,1 as its eigenvector. Recently, Stevanović[19], Zhang [], as well as Liu and Shen [1] studied the spectral radius of irregular graphs. The current best result is due to Liu and Shen as follows: For an irregular graph G of order n with maximum degree Δ, ρ(g Δ (Δ + 1/[n(3n + Δ 4]. Similarly, the Laplacian spectral radius of a bipartite d-regular graph is precisely equal to d. We give an upper bound on the Laplacian spectral radius of irregular graphs analogous to that of the spectral radius. Theorem 3.4. Let G be a connected irregular graph of order n with maximum degree Δ. Then μ(g < Δ /(n n. Since the diameter of a connected graph G satisfies d(g< n, Theorem 3.4 follows easily from the following result. Theorem 3.5. Let G be a connected irregular graph of order n and diameter d. Let Δ = Δ(G. Then μ(g < Δ (d + 1n. Proof. Let μ = μ(g, A = A(G, D = D(G and Q = D + A. By normalizing, we may assume that the positive eigenvector x of ρ(q is a unit vector. Let v k and v l be the vertices with x k = max i x i and x l = min i x i respectively. Then Lemma 3.1 implies that 1/, Δ μ Δ ρ(q = Δ x T (D + Ax n n = (Δ d i xi + d i xi i=1 x l + v i v j E(G i=1 (x i x j. v i v j E(G x i x j
15 768 L. Shi / Linear Algebra and its Applications 4 ( Let P be a shortest path of length a d from v k to v l. Then we have (x i x j (x i x j / (x i x j a (x k x l /d. v i v j E(G v i v j E(P v i v j E(P Thus by noting that xk > 1/n for G is irregular, we obtain Δ μ xl + (x k x l /d xk /(d + 1 >/[(d + 1n]. The bound in Theorem 3.4 is asymptotically best possible when Δ is fixed. This is shown by the following example. The sum G 1 G of two graphs G 1 = (V 1,E 1 and G = (V,E is a graph with vertex set V 1 V in which two vertices (u 1,u and (v 1,v are adjacent if and only if either u 1 = v 1 and u v E or u 1 v 1 E 1 and u = v. It is known [1,7] that the Laplacian spectrum of G 1 G consists of all possible sums λ(g 1 + λ(g where λ(g i is in the Laplacian spectrum of G i for i = 1,. In particular, μ(g 1 G = μ(g 1 + μ(g.itis easy to see that a complete bipartite regular graph K Δ,Δ has the Laplacian spectral radius μ(k Δ,Δ = (Δ. It is also known [18] that a path P m of order m has the Laplacian spectral radius μ(p m = + cos(π/m. Then the Laplacian spectral radius of P m K Δ,Δ with n = (Δ m vertices satisfies μ(p m K Δ,Δ = μ(p m + μ(k Δ,Δ = + cos(π/m + (Δ = Δ [1 cos(π/m] =Δ 4 sin π m > Δ π /m = Δ 4π (Δ /n Bounds by covering numbers Let G be a graph. A set of vertices C of G is called a cover of G if every edge of G is incident to some vertex in C. The least cardinality of a cover of G is called the covering number of G and denoted by τ(g. In order to give a lower bound for the Laplacian spectral radius of graphs in terms of the covering number, we first need a lemma due to Lu et al. [14]. The original form of this lemma is for connected graphs. However, the proof there applies also for disconnected graphs. Thus we have Lemma 3. [14]. Let G be a graph of order n and G 1 be an induced subgraph of G with n 1 (n 1 <nvertices and average degree r 1. Set d 1 = (G 1 d(v/n 1. Then μ(g n(d 1 r 1 /(n n 1. The following theorem is an extension of results of Yuan [1] and of Lu et al. (Corollary 11 in [14] which assert that μ(g n/τ(g. Theorem 3.6. Let G be a graph of order n with minimum degree δ. Then μ(g δn/τ(g. Proof. Let C be a minimal covering set of G with C =τ(g and let m be the number of edges between C and V (G \ C. Then by the definition of covering set, we have m δ(n τ(g. Now Lemma 3. with the subgraph G 1 = G[C] induced by C implies that
16 L. Shi / Linear Algebra and its Applications 4 ( [ ]/ μ(g n(d 1 r 1 /(n τ(g = n (d(v d G1 (v [τ(g(n τ(g] v C = mn/[τ(g(n τ(g] δn/τ(g. It is well known that μ(g Δ. Thus by Theorem 3.6, we easily obtain a lower bound on the covering number of a graph. Corollary 3.. Let G be a graph of order n with maximum degree Δ and minimum degree δ. Then τ(g δn/μ(g δn/(δ. 3.. Bounds of the Nordhaus Gaddum type The well known bound μ(g Δ easily implies the simplest upper bound on the sum of Laplacian spectral radii of a graph G and its complement G c : μ(g + μ(g c (n 1 + (Δ δ. In particular, if both G and G c are connected and irregular then Theorem 3.4 implies a slightly better upper bound as follows: μ(g + μ(g c [n 1 /(n n]+(δ δ. Recently, Liu et al. [13] proved that μ(g + μ(g c n + (Δ + δ + 1 n + n + 4(Δ δ(n 1. Here we give another upper bound of the Nordhaus Gaddum type. Theorem 3.7. Let G be a graph of order n with 0 < δ(g Δ(G<n 1. Then μ(g + μ(g c (n 1 3δ(n 1 + (Δ + δ Δ + δ. Moreover, if both G and G c are connected then the upper bound is strict. Proof. Let f (m, Δ,δ=[Δ +4m δ(n 1 + Δ(δ 1] 1/. Note that Δ(G c = n 1 δ, δ(g c = n 1 Δ and m(g c = ( n m. Corollary 3.1 gives that (( μ(g f (m, Δ,δ and μ(g c n f m, n 1 δ, n 1 Δ. (( Now let g(m = f (m, Δ,δ+ f n m, n 1 δ, n 1 Δ. Then μ(g + μ(g c g(m. Since (( dg n dm = /f (m, Δ,δ /f m, n 1 δ, n 1 Δ, (( it is easy to check that dg dm 0 if and only if f (m, Δ,δ f n i.e. m [(n 1 δ(n Δ + δ + Δ]/4. Thus m, n 1 δ, n 1 Δ
17 770 L. Shi / Linear Algebra and its Applications 4 ( μ(g + μ(g c g([(n 1 δ(n Δ + δ + Δ]/4 = f([(n 1 δ(n Δ + δ + Δ]/4, Δ,δ = (n 1 3δ(n 1 + (Δ + δ Δ + δ. If both G and G c are connected, then either G or G c fails to be a bipartite regular graph. Corollary 3.1 implies that the Laplacian spectral radius of either G or G c fails to attain its upper bound and so does the sum. It is easy to see that the bound in Theorem 3.7 is incomparable to the known bounds listed above. Acknowledgments I thank Mei Lu for drawing me attention to the paper [4]. References [1] C.Y. Alari, G. Chartrand, O.R. Ollermann, A.J. Schwenk, Graph Theory, Combinatorics and Applications, Wiley, New York, 1991, pp [] D. Cao, Bounds on eigenvalues and chromatic numbers, Linear Algebra Appl. 70 ( [3] D. Cvetković, M. Doob, H. Sachs, Spectra of Graphs Theory and Application, Academic Press, New York, [4] K.Ch. Das, P. Kumar, Some new bounds on the spectral radius of graphs, Discrete Math. 81 ( [5] M.N. Ellingham, X. Zha, The spectral radius of graphs on surface, J. Combin. Thoery Ser. B 78 ( [6] O. Favaron, M. Mahéo, J.-F. Saclé, Some eigenvalue properties in graphs (conjectures of Graffiti. II, Discrete Math. 111 ( [7] M. Fiedler, Algebraic connectivity of graphs, Czechoslovak Math. J. 3 ( [8] Y. Hong, J. Shu, K. Fang, A sharp upper bound of the spectral radius of graphs, J. Combin. Theory Ser. B 81 ( [9] Y. Hong, X. Zhang, Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees, Discrete Math. 96 ( [10] J. Li, Y. Pan, de Cane s inequality and bounds on the largest Laplacian eigenvalue of a graph, Linear Algebra Appl. 38 ( [11] X. Li, The relations between the spectral radius of the graphs and their complement, J. North China Technol. Inst. 17 (4 ( [1] B. Liu, J. Shen, On the largest eigenvalue of nonregular graphs, preprint. [13] H. Liu, M. Lu, F. Tian, On the Laplacian spectral radius of a graph, Linear Algebra Appl. 376 ( [14] M. Lu, H. Liu, F. Tian, Bounds of Laplacian spectrum of graphs based on the domination number, Linear Algebra Appl. 40 ( [15] V. Nikiforov, Walks and the spectral radius of graphs, Linear Algebra Appl. 418 ( [16] E.A. Nordhaus, J.M. Gaddum, On complementary graphs, Amer. Math. Monthly 63 ( [17] E. Nosal, Eigenvalues of graphs, Master Thesis, University of Calgary, [18] M. Petrović, I. Gutman, The path is the tree with smallest greatest Laplacian eigenvalue, Kragujevac J. Math. 4 ( [19] D. Stevanović, The largest eigenvalue of nonregular graphs, J. Combin. Theory Ser. B 91 ( [0] A. Yu, M. Lu, F. Tian, On the spectral radius of graphs, Linear Algebra Appl. 387 ( [1] X. Yuan, The spectral radius of Laplace matrix of graphs, Master Thesis, East China Normal University, China, 003. [] X. Zhang, Eigenvectors and eigenvalues of nonregular graphs, Linear Algebra Appl. 409 ( [3] X. Zhang, R. Luo, The spectral radius of triangle-free graphs, Australas. J. Combin. 6 (
BOUNDS FOR LAPLACIAN SPECTRAL RADIUS OF THE COMPLETE BIPARTITE GRAPH
Volume 115 No. 9 017, 343-351 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu BOUNDS FOR LAPLACIAN SPECTRAL RADIUS OF THE COMPLETE BIPARTITE GRAPH
More informationLaplacian spectral radius of trees with given maximum degree
Available online at www.sciencedirect.com Linear Algebra and its Applications 429 (2008) 1962 1969 www.elsevier.com/locate/laa Laplacian spectral radius of trees with given maximum degree Aimei Yu a,,1,
More informationOn the second Laplacian eigenvalues of trees of odd order
Linear Algebra and its Applications 419 2006) 475 485 www.elsevier.com/locate/laa On the second Laplacian eigenvalues of trees of odd order Jia-yu Shao, Li Zhang, Xi-ying Yuan Department of Applied Mathematics,
More informationMinimizing the Laplacian eigenvalues for trees with given domination number
Linear Algebra and its Applications 419 2006) 648 655 www.elsevier.com/locate/laa Minimizing the Laplacian eigenvalues for trees with given domination number Lihua Feng a,b,, Guihai Yu a, Qiao Li b a School
More informationOn the spectral radius of graphs with cut edges
Linear Algebra and its Applications 389 (2004) 139 145 www.elsevier.com/locate/laa On the spectral radius of graphs with cut edges Huiqing Liu a,meilu b,, Feng Tian a a Institute of Systems Science, Academy
More informationThe Signless Laplacian Spectral Radius of Graphs with Given Degree Sequences. Dedicated to professor Tian Feng on the occasion of his 70 birthday
The Signless Laplacian Spectral Radius of Graphs with Given Degree Sequences Xiao-Dong ZHANG Ü À Shanghai Jiao Tong University xiaodong@sjtu.edu.cn Dedicated to professor Tian Feng on the occasion of his
More informationarxiv: v1 [math.co] 20 Sep 2014
On some papers of Nikiforov Bo Ning Department of Applied Mathematics, School of Science, Northwestern Polytechnical University, Xi an, Shaanxi 71007, P.R. China arxiv:109.588v1 [math.co] 0 Sep 01 Abstract
More informationThe spectral radius of edge chromatic critical graphs
The spectral radius of edge chromatic critical graphs Lihua Feng b, Jianxiang Cao c, Weijun Liu a,b, Shifeng Ding b, Henry Liu b a School of Science, Nantong University, Nantong, Jiangshu, 6019, China.
More informationImproved Upper Bounds for the Laplacian Spectral Radius of a Graph
Improved Upper Bounds for the Laplacian Spectral Radius of a Graph Tianfei Wang 1 1 School of Mathematics and Information Science Leshan Normal University, Leshan 614004, P.R. China 1 wangtf818@sina.com
More informationThe Laplacian spectrum of a mixed graph
Linear Algebra and its Applications 353 (2002) 11 20 www.elsevier.com/locate/laa The Laplacian spectrum of a mixed graph Xiao-Dong Zhang a,, Jiong-Sheng Li b a Department of Mathematics, Shanghai Jiao
More informationThe least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with k pendant vertices
Electronic Journal of Linear Algebra Volume 26 Volume 26 (2013) Article 22 2013 The least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with k pendant vertices Ruifang Liu rfliu@zzu.edu.cn
More informationLinear Algebra and its Applications
Linear Algebra and its Applications xxx (2008) xxx xxx Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: wwwelseviercom/locate/laa Graphs with three distinct
More informationELA
A NOTE ON THE LARGEST EIGENVALUE OF NON-REGULAR GRAPHS BOLIAN LIU AND GANG LI Abstract. The spectral radius of connected non-regular graphs is considered. Let λ 1 be the largest eigenvalue of the adjacency
More informationSpectral radius of bipartite graphs
Linear Algebra and its Applications 474 2015 30 43 Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa Spectral radius of bipartite graphs Chia-an
More informationOn the Least Eigenvalue of Graphs with Cut Vertices
Journal of Mathematical Research & Exposition Nov., 010, Vol. 30, No. 6, pp. 951 956 DOI:10.3770/j.issn:1000-341X.010.06.001 Http://jmre.dlut.edu.cn On the Least Eigenvalue of Graphs with Cut Vertices
More informationOn the spectral radius of bicyclic graphs with n vertices and diameter d
Linear Algebra and its Applications 4 (007) 9 3 www.elsevier.com/locate/laa On the spectral radius of bicyclic graphs with n vertices and diameter d Shu-Guang Guo Department of Mathematics, Yancheng Teachers
More informationOn the distance signless Laplacian spectral radius of graphs and digraphs
Electronic Journal of Linear Algebra Volume 3 Volume 3 (017) Article 3 017 On the distance signless Laplacian spectral radius of graphs and digraphs Dan Li Xinjiang University,Urumqi, ldxjedu@163.com Guoping
More informationApplied Mathematics Letters
Applied Mathematics Letters (009) 15 130 Contents lists available at ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml Spectral characterizations of sandglass graphs
More informationOn the spectral radii of quasi-tree graphs and quasiunicyclic graphs with k pendent vertices
Electronic Journal of Linear Algebra Volume 20 Volume 20 (2010) Article 30 2010 On the spectral radii of quasi-tree graphs and quasiunicyclic graphs with k pendent vertices Xianya Geng Shuchao Li lscmath@mail.ccnu.edu.cn
More informationGraphs determined by their (signless) Laplacian spectra
Electronic Journal of Linear Algebra Volume Volume (011) Article 6 011 Graphs determined by their (signless) Laplacian spectra Muhuo Liu liumuhuo@scau.edu.cn Bolian Liu Fuyi Wei Follow this and additional
More informationThe effect on the algebraic connectivity of a tree by grafting or collapsing of edges
Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 855 864 www.elsevier.com/locate/laa The effect on the algebraic connectivity of a tree by grafting or collapsing
More informationInequalities for the spectra of symmetric doubly stochastic matrices
Linear Algebra and its Applications 49 (2006) 643 647 wwwelseviercom/locate/laa Inequalities for the spectra of symmetric doubly stochastic matrices Rajesh Pereira a,, Mohammad Ali Vali b a Department
More informationOn the distance and distance signless Laplacian eigenvalues of graphs and the smallest Gersgorin disc
Electronic Journal of Linear Algebra Volume 34 Volume 34 (018) Article 14 018 On the distance and distance signless Laplacian eigenvalues of graphs and the smallest Gersgorin disc Fouzul Atik Indian Institute
More informationSpectral radii of graphs with given chromatic number
Applied Mathematics Letters 0 (007 158 16 wwwelseviercom/locate/aml Spectral radii of graphs with given chromatic number Lihua Feng, Qiao Li, Xiao-Dong Zhang Department of Mathematics, Shanghai Jiao Tong
More informationThe spectral radius of graphs on surfaces
The spectral radius of graphs on surfaces M. N. Ellingham* Department of Mathematics, 1326 Stevenson Center Vanderbilt University, Nashville, TN 37240, U.S.A. mne@math.vanderbilt.edu Xiaoya Zha* Department
More informationGraphs with given diameter maximizing the spectral radius van Dam, Edwin
Tilburg University Graphs with given diameter maximizing the spectral radius van Dam, Edwin Published in: Linear Algebra and its Applications Publication date: 2007 Link to publication Citation for published
More informationMaxima of the signless Laplacian spectral radius for planar graphs
Electronic Journal of Linear Algebra Volume 0 Volume 0 (2015) Article 51 2015 Maxima of the signless Laplacian spectral radius for planar graphs Guanglong Yu Yancheng Teachers University, yglong01@16.com
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationUnicyclic graphs with exactly two main eigenvalues
Applied Mathematics Letters 19 (006) 1143 1147 www.elsevier.com/locate/aml Unicyclic graphs with exactly two main eigenvalues Yaoping Hou a,,fengtian b a Department of Mathematics, Hunan Normal University
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 430 (2009) 532 543 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: wwwelseviercom/locate/laa Computing tight upper bounds
More informationTHE HARMONIC INDEX OF UNICYCLIC GRAPHS WITH GIVEN MATCHING NUMBER
Kragujevac Journal of Mathematics Volume 38(1 (2014, Pages 173 183. THE HARMONIC INDEX OF UNICYCLIC GRAPHS WITH GIVEN MATCHING NUMBER JIAN-BO LV 1, JIANXI LI 1, AND WAI CHEE SHIU 2 Abstract. The harmonic
More informationApplications of Eigenvalues in Extremal Graph Theory
Applications of Eigenvalues in Extremal Graph Theory Olivia Simpson March 14, 201 Abstract In a 2007 paper, Vladimir Nikiforov extends the results of an earlier spectral condition on triangles in graphs.
More informationA Sharp Upper Bound on Algebraic Connectivity Using Domination Number
A Sharp Upper Bound on Algebraic Connectivity Using Domination Number M Aouchiche a, P Hansen a,b and D Stevanović c,d a GERAD and HEC Montreal, Montreal, Qc, CANADA b LIX, École Polytechnique, Palaiseau,
More informationEnergy of Graphs. Sivaram K. Narayan Central Michigan University. Presented at CMU on October 10, 2015
Energy of Graphs Sivaram K. Narayan Central Michigan University Presented at CMU on October 10, 2015 1 / 32 Graphs We will consider simple graphs (no loops, no multiple edges). Let V = {v 1, v 2,..., v
More informationFiedler s Theorems on Nodal Domains
Spectral Graph Theory Lecture 7 Fiedler s Theorems on Nodal Domains Daniel A. Spielman September 19, 2018 7.1 Overview In today s lecture we will justify some of the behavior we observed when using eigenvectors
More informationOn the Randić index. Huiqing Liu. School of Mathematics and Computer Science, Hubei University, Wuhan , China
Journal of Mathematical Chemistry Vol. 38, No. 3, October 005 ( 005) DOI: 0.007/s090-005-584-7 On the Randić index Huiqing Liu School of Mathematics and Computer Science, Hubei University, Wuhan 43006,
More informationIntrinsic products and factorizations of matrices
Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 5 3 www.elsevier.com/locate/laa Intrinsic products and factorizations of matrices Miroslav Fiedler Academy of Sciences
More informationarxiv: v2 [math.co] 27 Jul 2013
Spectra of the subdivision-vertex and subdivision-edge coronae Pengli Lu and Yufang Miao School of Computer and Communication Lanzhou University of Technology Lanzhou, 730050, Gansu, P.R. China lupengli88@163.com,
More informationGraph fundamentals. Matrices associated with a graph
Graph fundamentals Matrices associated with a graph Drawing a picture of a graph is one way to represent it. Another type of representation is via a matrix. Let G be a graph with V (G) ={v 1,v,...,v n
More informationA lower bound for the spectral radius of graphs with fixed diameter
A lower bound for the spectral radius of graphs with fixed diameter Sebastian M. Cioabă Department of Mathematical Sciences, University of Delaware, Newark, DE 19716, USA e-mail: cioaba@math.udel.edu Edwin
More informationOrdering trees by their largest eigenvalues
Linear Algebra and its Applications 370 (003) 75 84 www.elsevier.com/locate/laa Ordering trees by their largest eigenvalues An Chang a,, Qiongxiang Huang b a Department of Mathematics, Fuzhou University,
More informationSome Nordhaus-Gaddum-type Results
Some Nordhaus-Gaddum-type Results Wayne Goddard Department of Mathematics Massachusetts Institute of Technology Cambridge, USA Michael A. Henning Department of Mathematics University of Natal Pietermaritzburg,
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 432 2010 661 669 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: wwwelseviercom/locate/laa On the characteristic and
More informationOn Brooks Coloring Theorem
On Brooks Coloring Theorem Hong-Jian Lai, Xiangwen Li, Gexin Yu Department of Mathematics West Virginia University Morgantown, WV, 26505 Abstract Let G be a connected finite simple graph. δ(g), (G) and
More informationON THE WIENER INDEX AND LAPLACIAN COEFFICIENTS OF GRAPHS WITH GIVEN DIAMETER OR RADIUS
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 63 (2010) 91-100 ISSN 0340-6253 ON THE WIENER INDEX AND LAPLACIAN COEFFICIENTS OF GRAPHS WITH GIVEN DIAMETER
More informationEnergy, Laplacian Energy and Zagreb Index of Line Graph, Middle Graph and Total Graph
Int. J. Contemp. Math. Sciences, Vol. 5, 21, no. 18, 895-9 Energy, Laplacian Energy and Zagreb Index of Line Graph, Middle Graph and Total Graph Zhongzhu Liu Department of Mathematics, South China Normal
More informationBounds for Levinger s function of nonnegative almost skew-symmetric matrices
Linear Algebra and its Applications 416 006 759 77 www.elsevier.com/locate/laa Bounds for Levinger s function of nonnegative almost skew-symmetric matrices Panayiotis J. Psarrakos a, Michael J. Tsatsomeros
More informationOn trees with smallest resolvent energies 1
On trees with smallest resolvent energies 1 Mohammad Ghebleh, Ali Kanso, Dragan Stevanović Faculty of Science, Kuwait University, Safat 13060, Kuwait mamad@sci.kuniv.edu.kw, akanso@sci.kuniv.edu.kw, dragance106@yahoo.com
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationEstimating the Spectral Radius of a Graph by the Second Zagreb Index
Estimating the Spectral Radius of a Graph by the Second Zagreb Index Hosam Abdo, Darko Dimitrov Institute of Computer Science, Freie Universität Berlin, Takustraße 9, D 14195 Berlin, Germany abdo@mi.fu-berlin.de,
More informationThe chromatic number and the least eigenvalue of a graph
The chromatic number and the least eigenvalue of a graph Yi-Zheng Fan 1,, Gui-Dong Yu 1,, Yi Wang 1 1 School of Mathematical Sciences Anhui University, Hefei 30039, P. R. China fanyz@ahu.edu.cn (Y.-Z.
More informationDiscrete Mathematics
Discrete Mathematics 3 (0) 333 343 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/disc The Randić index and the diameter of graphs Yiting Yang a,
More informationThe Hierarchical Product of Graphs
The Hierarchical Product of Graphs Lali Barrière Francesc Comellas Cristina Dalfó Miquel Àngel Fiol Universitat Politècnica de Catalunya - DMA4 April 8, 2008 Outline 1 Introduction 2 Graphs and matrices
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 436 (2012) 4043 4051 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa On the spectral radius
More informationThe minimal spectral radius of graphs with a given diameter
Linear Algebra and its Applications 43 (007) 408 419 www.elsevier.com/locate/laa The minimal spectral radius of graphs with a given diameter E.R. van Dam a,, R.E. Kooij b,c a Tilburg University, Department
More informationLaplacian Integral Graphs with Maximum Degree 3
Laplacian Integral Graphs with Maximum Degree Steve Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A kirkland@math.uregina.ca Submitted: Nov 5,
More informationA Survey on Comparing Zagreb Indices
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 65 (2011) 581-593 ISSN 0340-6253 A Survey on Comparing Zagreb Indices Bolian Liu and Zhifu You School of
More informationD-EQUIENERGETIC SELF-COMPLEMENTARY GRAPHS
123 Kragujevac J. Math. 32 (2009) 123 131. D-EQUIENERGETIC SELF-COMPLEMENTARY GRAPHS Gopalapillai Indulal 1 and Ivan Gutman 2 1 Department of Mathematics, St. Aloysius College, Edathua, Alappuzha 689573,
More informationA lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo
A lower bound for the Laplacian eigenvalues of a graph proof of a conjecture by Guo A. E. Brouwer & W. H. Haemers 2008-02-28 Abstract We show that if µ j is the j-th largest Laplacian eigenvalue, and d
More informationInverse Perron values and connectivity of a uniform hypergraph
Inverse Perron values and connectivity of a uniform hypergraph Changjiang Bu College of Automation College of Science Harbin Engineering University Harbin, PR China buchangjiang@hrbeu.edu.cn Jiang Zhou
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More informationLaplacians of Graphs, Spectra and Laplacian polynomials
Laplacians of Graphs, Spectra and Laplacian polynomials Lector: Alexander Mednykh Sobolev Institute of Mathematics Novosibirsk State University Winter School in Harmonic Functions on Graphs and Combinatorial
More informationSpectral Theory of Unsigned and Signed Graphs Applications to Graph Clustering. Some Slides
Spectral Theory of Unsigned and Signed Graphs Applications to Graph Clustering Some Slides Jean Gallier Department of Computer and Information Science University of Pennsylvania Philadelphia, PA 19104,
More informationThe Normalized Laplacian Estrada Index of a Graph
Filomat 28:2 (204), 365 37 DOI 0.2298/FIL402365L Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat The Normalized Laplacian Estrada
More informationv iv j E(G) x u, for each v V(G).
Volume 3, pp. 514-5, May 01 A NOTE ON THE LEAST EIGENVALUE OF A GRAPH WITH GIVEN MAXIMUM DEGREE BAO-XUAN ZHU Abstract. This note investigates the least eigenvalues of connected graphs with n vertices and
More informationCospectrality of graphs
Linear Algebra and its Applications 451 (2014) 169 181 Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa Cospectrality of graphs Alireza Abdollahi
More informationSome spectral inequalities for triangle-free regular graphs
Filomat 7:8 (13), 1561 1567 DOI 198/FIL138561K Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://wwwpmfniacrs/filomat Some spectral inequalities for triangle-free
More informationJournal of Science and Arts Year 17, No. 1(38), pp , 2017
Journal of Science and Arts Year 17, No. 1(38), pp. 49-60, 2017 BOUNDS FOR THE ENERGY OF ( ) ORIGINAL PAPER ( ) USING 2-ADJACENCY SERIFE BUYUKKOSE 1, SEMIHA BASDAS NURKAHLI 1, NURSAH MUTLU 1 Manuscript
More informationA lower bound for the harmonic index of a graph with minimum degree at least two
Filomat 7:1 013), 51 55 DOI 10.98/FIL1301051W Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat A lower bound for the harmonic index
More informationEquitable list colorings of planar graphs without short cycles
Theoretical Computer Science 407 (008) 1 8 Contents lists available at ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs Equitable list colorings of planar graphs
More informationepub WU Institutional Repository
epub WU Institutional Repository Türker Biyikoglu and Josef Leydold Largest Eigenvalues of Degree Sequences Working Paper Original Citation: Biyikoglu, Türker and Leydold, Josef (2006) Largest Eigenvalues
More informationLAPLACIAN ENERGY OF UNION AND CARTESIAN PRODUCT AND LAPLACIAN EQUIENERGETIC GRAPHS
Kragujevac Journal of Mathematics Volume 39() (015), Pages 193 05. LAPLACIAN ENERGY OF UNION AND CARTESIAN PRODUCT AND LAPLACIAN EQUIENERGETIC GRAPHS HARISHCHANDRA S. RAMANE 1, GOURAMMA A. GUDODAGI 1,
More informationLaplacians of Graphs, Spectra and Laplacian polynomials
Mednykh A. D. (Sobolev Institute of Math) Laplacian for Graphs 27 June - 03 July 2015 1 / 30 Laplacians of Graphs, Spectra and Laplacian polynomials Alexander Mednykh Sobolev Institute of Mathematics Novosibirsk
More informationOn the Normalized Laplacian Energy(Randić Energy)
On the Normalized Laplacian Energy(Randić Energy) Selçuk University, Konya/Turkey aysedilekmaden@selcuk.edu.tr SGA 2016- Spectral Graph Theory and Applications May 18-20, 2016 Belgrade, SERBIA Outline
More informationEnergies of Graphs and Matrices
Energies of Graphs and Matrices Duy Nguyen T Parabola Talk October 6, 2010 Summary 1 Definitions Energy of Graph 2 Laplacian Energy Laplacian Matrices Edge Deletion 3 Maximum energy 4 The Integral Formula
More informationBipartite graphs with at most six non-zero eigenvalues
Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 11 (016) 315 35 Bipartite graphs with at most six non-zero eigenvalues
More informationExtremal Graphs for Randić Energy
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 77 (2017) 77-84 ISSN 0340-6253 Extremal Graphs for Randić Energy Kinkar Ch. Das, Shaowei Sun Department
More informationFiedler s Theorems on Nodal Domains
Spectral Graph Theory Lecture 7 Fiedler s Theorems on Nodal Domains Daniel A Spielman September 9, 202 7 About these notes These notes are not necessarily an accurate representation of what happened in
More informationThe Adjacency Matrix, Standard Laplacian, and Normalized Laplacian, and Some Eigenvalue Interlacing Results
The Adjacency Matrix, Standard Laplacian, and Normalized Laplacian, and Some Eigenvalue Interlacing Results Frank J. Hall Department of Mathematics and Statistics Georgia State University Atlanta, GA 30303
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 435 (2011) 1029 1033 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa Subgraphs and the Laplacian
More informationarxiv: v2 [math.co] 5 Nov 2015
Upper bounds for the achromatic and coloring numbers of a graph arxiv:1511.00537v2 [math.co] 5 Nov 2015 Baoyindureng Wu College of Mathematics and System Sciences, Xinjiang University Urumqi, Xinjiang
More informationThe spectrum of the edge corona of two graphs
Electronic Journal of Linear Algebra Volume Volume (1) Article 4 1 The spectrum of the edge corona of two graphs Yaoping Hou yphou@hunnu.edu.cn Wai-Chee Shiu Follow this and additional works at: http://repository.uwyo.edu/ela
More informationThis article was published in an Elsevier journal. The attached copy is furnished to the author for non-commercial research and education use, including for instruction at the author s institution, sharing
More informationThe eigenvalues of an n x n complex matrix A are the roots of the n th degree polynomial det(a-λi) = 0. Further the positive square roots of the
The eigenvalues of an n x n complex matrix A are the roots of the n th degree polynomial det(a-λi) = 0. Further the positive square roots of the eigenvalues of the positive semidefinite matrix A*A are
More informationNew skew Laplacian energy of a simple digraph
New skew Laplacian energy of a simple digraph Qingqiong Cai, Xueliang Li, Jiangli Song arxiv:1304.6465v1 [math.co] 24 Apr 2013 Center for Combinatorics and LPMC-TJKLC Nankai University Tianjin 300071,
More informationThe (signless) Laplacian spectral radii of c-cyclic graphs with n vertices, girth g and k pendant vertices
Linear and Multilinear Algebra ISSN: 0308-1087 Print 1563-5139 Online Journal homepage: http://www.tandfonline.com/loi/glma0 The signless Laplacian spectral radii of c-cyclic graphs with n vertices, girth
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 436 (2012) 99 111 Contents lists available at SciVerse ScienceDirect Linear Algebra and its Applications journal homepage: www.elsevier.com/locate/laa On weighted directed
More informationSome bounds for the spectral radius of the Hadamard product of matrices
Some bounds for the spectral radius of the Hadamard product of matrices Guang-Hui Cheng, Xiao-Yu Cheng, Ting-Zhu Huang, Tin-Yau Tam. June 1, 2004 Abstract Some bounds for the spectral radius of the Hadamard
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and education use, including for instruction at the authors institution
More information(This is a sample cover image for this issue. The actual cover is not yet available at this time.)
(This is a sample cover image for this issue. The actual cover is not yet available at this time.) This article appeared in a journal published by Elsevier. The attached copy is furnished to the author
More informationThis article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research and
This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research education use, including for instruction at the authors institution
More information17.1 Directed Graphs, Undirected Graphs, Incidence Matrices, Adjacency Matrices, Weighted Graphs
Chapter 17 Graphs and Graph Laplacians 17.1 Directed Graphs, Undirected Graphs, Incidence Matrices, Adjacency Matrices, Weighted Graphs Definition 17.1. A directed graph isa pairg =(V,E), where V = {v
More informationAbsolute value equations
Linear Algebra and its Applications 419 (2006) 359 367 www.elsevier.com/locate/laa Absolute value equations O.L. Mangasarian, R.R. Meyer Computer Sciences Department, University of Wisconsin, 1210 West
More informationThree conjectures in extremal spectral graph theory
Three conjectures in extremal spectral graph theory Michael Tait and Josh Tobin June 6, 2016 Abstract We prove three conjectures regarding the maximization of spectral invariants over certain families
More informationProgram (Day 1) Spectral mapping theorem and asymptotic behavior of quantum walks on infinite graphs
Program (Day 1) Nov.29 (Fri) Kawai Hall, Dept. of Math., Tohoku Univ. 9:25 9:30 10:10 10:20 11:00 11:10 11:50 14:00 14:40 14:50 15:30 15:40 16:30 18:00 Opening Address from Chair Spectral mapping theorem
More informationChapter 2 Spectra of Finite Graphs
Chapter 2 Spectra of Finite Graphs 2.1 Characteristic Polynomials Let G = (V, E) be a finite graph on n = V vertices. Numbering the vertices, we write down its adjacency matrix in an explicit form of n
More informationNormalized Laplacian spectrum of two new types of join graphs
Journal of Linear and Topological Algebra Vol. 6, No. 1, 217, 1-9 Normalized Laplacian spectrum of two new types of join graphs M. Hakimi-Nezhaad a, M. Ghorbani a a Department of Mathematics, Faculty of
More informationOn sum of powers of the Laplacian and signless Laplacian eigenvalues of graphs
On sum of powers of the Laplacian and signless Laplacian eigenvalues of graphs Saieed Akbari 1,2 Ebrahim Ghorbani 1,2 Jacobus H. Koolen 3,4 Mohammad Reza Oboudi 1,2 1 Department of Mathematical Sciences
More informationBOUNDS ON THE FIBONACCI NUMBER OF A MAXIMAL OUTERPLANAR GRAPH
BOUNDS ON THE FIBONACCI NUMBER OF A MAXIMAL OUTERPLANAR GRAPH Ahmad Fawzi Alameddine Dept. of Math. Sci., King Fahd University of Petroleum and Minerals, Dhahran 11, Saudi Arabia (Submitted August 1) 1.
More information