Extremal graph on normalized Laplacian spectral radius and energy
|
|
- Dwight Dennis
- 5 years ago
- Views:
Transcription
1 Electronic Journal of Linear Algebra Volume 9 Special volume for Proceedings of the International Conference on Linear Algebra and its Applications dedicated to Professor Ravindra B. Bapat Article Extremal graph on normalized Laplacian spectral radius and energy Kinkar Chandra Das SungkyunKwan University, kinkardas003@gmail.com SHAOWEI SUN Sungkyunkwan University, sunshaowei009@16.com Follow this and additional works at: Recommended Citation Das, Kinkar Chandra and SUN, SHAOWEI. (015), "Extremal graph on normalized Laplacian spectral radius and energy", Electronic Journal of Linear Algebra, Volume 9, pp DOI: This Article is brought to you for free and open access by Wyoming Scholars Repository. It has been accepted for inclusion in Electronic Journal of Linear Algebra by an authorized editor of Wyoming Scholars Repository. For more information, please contact scholcom@uwyo.edu.
2 Volume 31, pp , December 016 EXTREMAL GRAPHS FOR NORMALIZED LAPLACIAN SPECTRAL RADIUS AND ENERGY KINKAR CH. DAS AND SHAOWEI SUN Abstract. Let G = (V, E) be a simple graph of order n and the normalized Laplacian eigenvalues ρ 1 ρ ρ ρ n = 0. The normalized Laplacian energy (or Randić energy) of G without any isolated vertex is defined as RE(G) = n ρ i 1. i=1 In this paper, a lower bound on ρ 1 of connected graph G (G is not isomorphic to complete graph) is given and the extremal graphs (that is, the second minimal normalized Laplacian spectral radius of connected graphs) are characterized. Moreover, Nordhaus-Gaddum type results for ρ 1 are obtained. Recently, Gutman et al. gave a conjecture on Randić energy of connected graph [I. Gutman, B. Furtula, Ş. B. Bozkurt, On Randić energy, Linear Algebra Appl. 44 (014) 50 57]. Here this conjecture for starlike trees is proven. Key words. Normalized Laplaican spectral radius, Randić energy, Normalized Laplacian spread, Nordhaus-Gaddum type results, Vertex cover number AMS subject classifications. 05C50, 15A18 This paper is dedicated to Professor Ravindra B. Bapat on the occasion of his 60th birthday. 1. Introduction. Let G be a simple graph with vertex set V(G) = {v 1, v,..., v n and edge set E(G). Then its order is V(G), denoted by n, and its size is E(G), denoted by m. The degree d i of a vertex v i of a graph G is the cardinality of the neighborhood N i of the vertex v i. The maximum and second maximum degrees are denoted by 1 and, respectively. If vertices v i and v j are adjacent, we denote that Received by the editors on March 8, 016. Accepted for publication on December 1, 016. Handling Editor: Manjunatha Prasad Karantha Department of Mathematics, Sungkyunkwan University, Suwon , Republic of Korea (kinkardas003@googl .com, sunshaowei009@16.com). The first author was supported by the National Research Foundation funded by the Korean government with the grant no. 013R1A1A
3 Volume 31, pp , December K. C. Das and S. Sun by v i v j E(G). Let D(G) be the diagonalmatrixof vertexdegreesof agraph G. The Laplacian matrix L(G) is defined as D(G) A(G), where A(G) is the adjacency matrix ofg. Then the normalizedlaplacianmatrix ofgraphgwithout anyisolated vertexis defined as L(G) = D 1/ (G)L(G)D 1/ (G). Let ρ 1 (G) ρ (G) ρ (G) ρ n (G) = 0 be its eigenvalues. When only one graph is under consideration, then we write ρ i instead of ρ i (G). The normalized Laplacian energy (or Randić energy) of G is defined as RE(G) = n ρ i 1. i=1 Severalbounds onrandićenergycan be found inthe literature, see[9,10, 14]. Within classes of molecular graphs, a relatively good (increasing) linear correlation between Randić energy and energy of graphs has been investigated in the recent article by Furtula and Gutman [13]. For more information on Randić energy, we refer to the reader [11, 15]. The general Randić index R α (G) of graph G is defined as the sum of (d i d j ) α over all edges v i v j of G, where α is an arbitrary real number, that is, R α (G) = The general Randić index when α = 1 is R 1 (G) = v iv j E(G) v iv j E(G) (d i d j ) α. 1 d i d j. Some basic mathematical properties of R 1 (G) can be found in [5, 18] and the references therein. Throughout this paper we use P n, C n, S n, K n and K p,q (p+q = n) to denote the path graph, the cycle graph, the star graph, the complete graph and the complete bipartite graph on n vertices, respectively. For other undefined notations and terminologies from graph theory, the readers are referred to []. The tree of odd order n( 1), containing with pendant vertices, each attached to a vertex of degree, and a vertex of degree, will be called the ( ) - sun. The tree of even order n( ), obtained from a n 4 -sun and a n 4 -sun, by connecting their central vertices, will be called a ( n 4, n 4 ) -double sun. CONJECTURE 1.1. [14] If n 1 is odd, then the connected graph of order n, having greatest Randić energy is the sun. If n is even, then the connected graph of order n, having greatest Randić energy is the balanced double sun. Thus, if n is
4 Volume 31, pp , December 016 Extremal graph on normalized Laplacian spectral radius and energy 39 odd, then the tree with maximal RE is the ( ) -sun. If n is even, then this tree is the ( n 4, n 4 ) -double sun. The paper is organized as follows. In Section, we give a list of some previously known results. In Section 3, we obtain a lower bound on ρ 1 (G) for connected graphs and characterize the extremal graphs. Using this result we present some bounds on the normalized Laplaican spread (ρ 1 ρ ) and Nordhaus-Gaddum type results for ρ 1. In Section 4, we prove Conjecture 1.1 for starlike trees.. Preliminaries. Here we recall some basic properties of the normalized Laplacian eigenvalues which will be used in next two sections. Lemma.1. [7] Let G be a connected graph of order n. Then ρ n with equality holding if and only if G = K n. If G is not the complete graph K n, then ρ 1. Lemma.. [7] Let G be a connected graph of order n. Then n ρ 1 with left equality holding if and only if G = K n, and right equality holding if and only if G = K p,q with n = p+q. Lemma.3. [7] Let G be a bipartite graph of order n. For each ρ i, the value ρ i is also an eigenvalue of G. The join G 1 G of graphs G 1 and G is the graph obtained from the disjoint union of G 1 and G by adding all edges between V(G 1 ) and V(G ). Let K r s,t = K r (Ks Kt ) with r, s, t 1. Lemma.4. [17] Let G be a connected graph with order n 3. Then G = K r s,t if and only if G is {S 4, P 4, C 4 -free. In [4], Cavers found the normalized Laplacian spectrum of G = K 1 qks with n = 1+qs: (.1) { s+1 NLS(G) = s Note that G = K 1 s,s when q =.,, s+1 s {{ sq q+1, 1 s,, 1, 0 {{ s q 1 Lemma.5. [1] Let G = (V, E) be a graph of order n. If N i = N j, i( )j = 1,,..., k, then G has at least k 1 equal normalized Laplacian eigenvalues 1. Let ρ be an eigenvalue with a corresponding eigenvector x = (x 1, x,..., x n ) T of the matrix Q(= D 1 L) with non-isolated vertices of graph G. Since the normalized Laplacian matrix L and Q are similar, then they have the same spectrum. We have.
5 Volume 31, pp , December K. C. Das and S. Sun Qx = ρx, that is, (.) ρx i = x i 1 d i x j, i = 1,,..., n. v j:v iv j E(G) By multiplying d i x i to each side of the above equation, we get (1 ρ)d i x i = x i x j, i = 1,,..., n. v j:v iv j E(G) (.3) Taking summation on the above from i = 1 to n, we get x i x j ρ = 1 From this we get the following result: v iv j E(G) n d i x i i=1 Lemma.6. [7] Let G be a graph of order n with non-isolated vertices. Then x i x j ρ 1 1 v iv j E(G) n i=1 for any non-zero vector x = (x 1, x,..., x n ) T. Lemma.7. Let K t be a complete graph on t vertices with V(K t ) = {v 1, v,..., v t. Also let H be a graph of order n t with V(H) = {v t+1, v t+,..., v n. Fix q (1 q n t), then the resultant graph G = (V, E) is as follows: V(G) = V(K t ) V(H) = {v 1, v,..., v n, d i x i E(G) = E(K t ) E(H) {v i v j : i = 1,,..., t; j = t+1, t+,..., t+q. Then G has at least t 1 equal normalized Laplacian eigenvalues Proof. From (.), we get ρx i = x i 1 q +t 1 One can easily see that ρ = t+q t+q 1 v j:v iv j E(G)., x j, i = 1,,..., t. t+q t+q 1. with corresponding eigenvectors (1, 1, 0,..., 0) T, (1, 0, 1, 0,..., 0) T,..., (1, 0,..., 1, 0,..., 0) T {{{{{{ 3 t
6 Volume 31, pp , December 016 Extremal graph on normalized Laplacian spectral radius and energy 41 satisfy the above relation. Since these eigenvectors are linearly independent, we get the required result. Lemma.8. Let G = K a Kn a (1 a n 1). Then the normalized Laplacian spectrum of graph G is { NLS(G) = 1+ a, n,, n, 1,,1, 0. {{ {{ a 1 n a 1 Proof. By Lemmas.5 and.7, we have two normalized Laplacian eigenvalues of n G are with multiplicity n a 1 and 1 with multiplicity a 1. Since ρ n = 0 and n ρ i = n, we get the required result. i=1 For a graph G = (V, E), a vertex cover of G is a set of vertices C V such that every edge of G is incident to at least one vertex in C. A minimum vertex cover is a vertex cover C such that no other vertex cover is smaller in size than C. The vertex cover number c is the size of the minimum vertex cover. Lemma.9. [6] For a tree with vertex cover number c, the multiplicity of the normalized Laplacian eigenvalue 1 is exactly n c. A matching M in G is a set of pairwise non-adjacent edges, that is, no two edges share a common vertex. A maximum matching is a matching that contains the largest possible number of edges. The matching number ν of a graph G is the size of a maximum matching. Lemma.10. (König s matching theorem) [] For any bipartite graph G, ν = c. Denoted by T(n, k, n 1, n,..., n k ), is a tree of order n formed by joining the center v i ofstar S ni to a new vertex v for i = 1,,..., k with n 1 n n k 1, that is, T(n, k, n 1, n,..., n k ) {v = S n1 S n S nk. In particular, we have T(n, k,,,..., ) = ( ) -sun, where k = and n is odd. Lemma.11. [1] Let T = (V, E) be a tree of order n 3. Also let v 1 and v be the maximum and the second maximum degree vertices of degrees 1 and, respectively. If v 1 v / E(T), then ρ (T) with equality holding if and only if T = T(n, k, n 1, n,...,n k ), n 1 = n.
7 Volume 31, pp , December K. C. Das and S. Sun 3. Normalized Laplacian spectral radius of graphs. K 1 s,s (s+1 = n) Fig. 1: Graph K 1 s,s with s+1 = n. Several lower bounds on ρ 1 in terms of graph parameters (n, m, 1 etc.) are known, see [16] and the references therein. Moreover, it is already known that the complete graph gives the minimal normalized Laplacian spectral radius of a connected graph G of order n. In this section our aim is to find the second minimal normalized Laplacian spectral radius of a connected graph G of order n. For this we give a lower bound on ρ 1 of a connected graph G and characterize the extremal graphs. Theorem 3.1. Let G( K n ) be a connected graph of order n. Then (3.1) ρ 1 n+1 with equality holding if and only if G = K n e or Ks,s 1 with s+1 = n (see, Fig. 1). Proof. First we prove this result when P 4 or C 4 or S 4 is an induced subgraph of G. Suppose that the path P 4 : v i v j v k v l is an induced subgraph of the graph G. If d i +d j +d k +d l < 3n 3, then we set x i = 1, x j = 1, x k = 1, x l = 1 and all the other components are 0 in (.3). We have ρ > n+1 d i +d j +d k +d l. Otherwise, d i +d j +d k +d l 3n 3. Let CN = N i N j N k N l with CN = a, where 0 a n 4. Since each vertex in CN is adjacent to {v i, v j, v k, v l and CN = a, we must have d i +d j +d k +d l 3(n 4 a)+4a+6 = 3n+a 6 and hence 3 a n 4. Setting x i = x j = x k = x l = 1, x r = 4 a+1 for v r CN,
8 Volume 31, pp , December 016 Extremal graph on normalized Laplacian spectral radius and energy 43 and all the other components are 0 in (.3), we have 16a a+1 3 ρ 1 1+ d i +d j +d k +d l + vrvs E(G), vr,vs CN 16 (a+1) 16 (a+1) v r CN d r. Since vrvs E(G), vr,vs CN 16 (a+1) 8a(a 1) (a+1) and v r CN d r a(), from the above result, we have (3.) ρ a +18a 3 3a +a+3+(a 3)(a+1) /(). For 4 a n 4, we have a a 3 = (a 3)(a+1) > 0 and a+1 < and hence 5a +18a 3> 3a +a+3+(a 3)(a+1)> 3a +a+3+(a 3)(a+1) /(). Then by (3.), again we get ρ 1 > n+1. For a = 3, by (3.), we have ρ with equality holding if and only if x i = x j = x k = x l = 1, x r = 1 for v r CN, and all the other components are 0. By (.), we have 1+ = 1+ d i and hence d i = n 1, which is a contradiction with d i n 3. Therefore we get ρ 1 > n+1. Next suppose that the cycle C 4 = v i v j v k v l v i is an induced subgraph of the graph G. Then d t n, t = i, j, k, l. Setting x i = 1, x j = 1, x k = 1, x l = 1 and all the other components are 0 in (.3), we have ρ d i +d j +d k +d l 1+ n > n+1. Next suppose that the star S 4 is an induced subgraph of the graph G with vertex set V(S 4 ) = {v 1, v, v 3, v 4, where v 1 v i E(G), i =, 3, 4. First we assume that the vertices v, v 3 and v 4 have at least two common neighbors {v 1, v 5, (say). Then
9 Volume 31, pp , December K. C. Das and S. Sun d i n 3 for i =, 3, 4. Setting x 1 = 1, x = 1, x 3 = 1, x 4 = 1, x 5 = 1 and all the other components are 0 in (.3), we have if v 1 v 5 E(G) with d 1, d 5 d 1 +d +d 3 +d 4 +d 5 ρ if v 1 v 5 / E(G) with d 1, d 5 n d 1 +d +d 3 +d 4 +d ()+3(n 3) > n+1. Next we assume that v, v 3 and v 4 have exactly one common neighbor. Hence d +d 3 +d 4 (n 4)+3 = n 5. Setting x 1 = 1, x = 1, x 3 = 1, x 4 = 1 and all the other components are 0 in (.3), we have ρ d 1 +d +d 3 +d 4 +n 5 > n+1. We now consider the graph G with {S 4, P 4, C 4 -free. By Lemma.4, we have G = K r s,t (r +s+t = n) as G is connected. Then by Lemma.7, one can easily get that the normalized Laplacian eigenvalues of G are { s+r s+r 1,..., s+r t+r, {{ s+r 1 t+r 1,..., t+r, {{ t+r 1 s 1 t 1 n,..., n {{ r 1 and the remaining three eigenvalues satisfy the following equations: ρx 1 = x 1 1 ((r 1)x 1 +sx +tx 3 ) ρx = x ρx 3 = x 3 1 r+s 1 ((s 1)x +rx 1 ) 1 r+t 1 ((t 1)x 3 +rx 1 ). Therefore the remaining three normalized Laplacian eigenvalues of G satisfy the following equation xf(x) = 0,
10 Volume 31, pp , December 016 where ( f(x) = x Extremal graph on normalized Laplacian spectral radius and energy 45 r s+r 1 + s+t + + ) r x+ r+t 1 sr (r+t 1)() r (s+r 1)(r +t 1) + rt (s+r 1)(). f Now, ( ) ( n+1 n+1 = = + r n t 1 n r r n s 1 ) ( ) n+1 sr (n s 1)() + r (n t 1)(n s 1) + rt (n t 1)() ( r+1 r(n s t ) ) ( ) n+1 (n s 1)(n t 1) + n()r rst ()(n s 1)(n t 1) (3.3) = nr n r+1+(n+1)st (n 3)rst () (n s 1)(n t 1). Without loss of generality, we can assume that t s. We now consider two cases (i) r = 1, (ii) r. Case(i) : r = 1. Since s t, from (3.3), we get f ( ) n+1 = 4st () st() 0. Thus we have ρ 1 n+1 with equality holding if and only if s = t =, that is, if and only if G = Ks,s 1 with s+1 = n. Case(ii) : r. If s = t = 1, we have G = K n e. By Lemma.8, ρ 1 (G) = n+1 and hence the equality holds in (3.1). Otherwise, we consider the following two subcases: Subcase(a) : s = 1 and t. In this subcase, from (3.3), we get f ( ) n+1 = nr n r+1+(n+1)t (n 3)rt (). (n )(n t 1)
11 Volume 31, pp , December K. C. Das and S. Sun For n = 5 or 6, one can check directly that ( ) n+1 (3.4) f < 0. Otherwise, n 7. Since t and n r +3, we have t[(n 3)r (n+1)] nr+n +r 1 [(n 3)r (n+1)] nr+n +r 1 = () 4(r+1) > 0. Again (3.4) holds and hence the inequality in (3.1) is strict. Subcase(b) : t s. If n = 6, then G = K, and hence the inequality in (3.1) is strict. Otherwise, n 7. Now, st[(n 3)r (n+1)] nr+n +r 1 4[(n 3)r (n+1)] nr+n +r 1 = r(n 5)+(n ) 9 > 0. Again (3.4) holds and hence the inequality in (3.1) is strict. Using the above theorem, we can obtain a lower bound for the normalized Laplacianspread(ρ 1 ρ )ofallgraphsg( K n, K n )with fixedordernandcharacterize the extremal graphs. Theorem 3.. Let G ( K n, K n ) be a graph with order n. Then ρ 1 ρ with equality holding if and only if G = K n e. Proof. First we assume that G is a disconnected graph. Since G K n, then G has at least one edge. Thus we have ρ 1 > 1 and ρ = 0. Hence ρ 1 ρ >. Next we assume that G is a connected graph. Since G K n, by Lemma.1 and Theorem 3.1, we have ρ 1 n+1 and ρ 1. Thus ρ 1 ρ. Moreover, ρ 1 ρ = if and only if ρ = 1 and ρ 1 = n+1. Again by Theorem 3.1, we have ρ 1 = n+1 if and only if G = K n e or G = Ks,s 1 with s+1 = n. By (.1), we get ρ (Ks,s) 1 = (s + 1 = n). By Lemma.8, we have ρ (K n e) = 1. This completes the proof of the theorem. We now give the first n+ minimal normalized Laplacian spectral radius of graphs with order n. Theorem 3.3. (i) Let G / {K n, K K 1, K n K,..., K p+1 K p, K p K p+1, K n e, K 1 p,p be a graph of odd order n (= p+1). Then ρ 1 (K n ) < ρ 1 (K K 1 ) < ρ 1 (K n K ) < < ρ 1 (K p+ K p 1 )
12 Volume 31, pp , December 016 (3.5) Extremal graph on normalized Laplacian spectral radius and energy 47 < ρ 1 (K p+1 K p ) = ρ 1 (K n e) = n+1 = ρ 1(K 1 p,p ) < ρ 1(G). (ii) Let G / {K n, K K 1, K n K,..., K p+ K p, K p+1 K p 1, K n e be a graph of even order n (= p). Then ρ 1 (K n ) < ρ 1 (K K 1 ) < ρ 1 (K n K ) < < ρ 1 (K p+ K p ) (3.6) < ρ 1 (K p+1 K p 1 ) < ρ 1 (K n e) = n+1 < ρ 1(G). Proof. We have For n = p+1, we have ρ 1 (K n i K i ) = n i, i = 1,,..., n. n i 1 ρ 1 (K n ) < ρ 1 (K K 1 ) < ρ 1 (K n K ) < < ρ 1 (K p+ K p 1 ) (3.7) < ρ 1 (K p+1 K p ) = n+1. For n = p, we have ρ 1 (K n ) < ρ 1 (K K 1 ) < ρ 1 (K n K ) < < ρ 1 (K p+ K p ) (3.8) < ρ 1 (K p+1 K p 1 ) = n+ n < n+1. First we assume that G is a connected graph. For G K n, by Theorem 3.1, we have ρ 1 (G) n+1 with equality holding if and only if G = K n e or K 1 s,s with s+1 = n. From the above results, we get the required results in (3.5) and (3.6). Next we assume that G is a disconnected graph. Let G 1, G,..., G k be the k (k ) connected components in G. Also let n i be the number of vertices in G i, k i = 1,,..., k such that n i = n with n 1 n n k. If n, then by Lemma., ρ 1 (G) = max i=1 { ρ 1 (G 1 ), ρ 1 (G ),..., ρ 1 (G k ) 1+ 1 n 1 > n+1
13 Volume 31, pp , December K. C. Das and S. Sun and hence the two inequalities hold in (3.5) and (3.6). Otherwise, n = 1. Then G = G 1 K k 1. We consider the following two cases: Case(i) : n = p+1. If k p+, then ρ 1 (G) = ρ 1 (G 1 ) n 1 n k +1 = > n+1 n 1 1 n k and hence the inequality (3.5) holds. Otherwise, k p+1. For G 1 = Kn k+1, then G = K n k+1 K k 1 and hence the inequality holds in (3.7), that is, the inequality holds in (3.5). Otherwise, G 1 K n k+1. Using Theorem 3.1, we get ρ 1 (G) = ρ 1 (G 1 ) n k + n k > n+1 and hence the inequality holds in (3.5). Case(ii) : n = p. Similarly, as Case (i), we consider k p+1 and k p, and we can see that the inequality holds in (3.6). We now obtain Nordhaus-Gaddum type results on ρ 1 (G). Theorem 3.4. Let G( K n, K n ) be a graph of order n. Then (3.9) ρ 1 (G)+ρ 1 (G) + 4 with equality holding if and only if G = K K1 or G = S 3. Proof. Since G K n, K n, we have n 3. For n = 3, G = K K1 or G = S 3. Hence the equality holds in (3.9). Otherwise, n 4. One can easily see that both G and G, or one of them must be connected. Without loss of generality, we can assume that G is connected. If G is connected, by Theorem 3.1 we have ρ 1 (G)+ρ 1 (G) > + 4. Otherwise, G is disconnected. If G K i Kn i ( i ), then by Theorem 3.3, we have ρ 1 (G) > 1+ and hence ρ 1(G)+ρ 1 (G) > + 4, by Theorem 3.1. { Next we only have to consider the remaining case: G K i K n i i. Therefore ρ 1 (G) = i i 1 ( i ). By Lemma.8, we have ρ 1(G) = 1+ i ( i ) and hence ρ 1 (G)+ρ 1 (G) = + 1 i 1 + i.
14 Volume 31, pp , December 016 Extremal graph on normalized Laplacian spectral radius and energy 49 It is easy to see that the function f(x) = + 1 x 1 + x is decreasing on [, +1] and increasing on ( +1, ]. Since n 4, we have ρ 1 (G)+ρ 1 (G) f( +1) = + This completes the proof of the theorem. Theorem 3.5. Let G be a graph of order n(> ). Then + 1 > + 4. (3.10) ρ 1 (G)+ρ 1 (G) 4 with equality holding if and only if G {S 3, P 4, K,n, K Kn. Proof. One can easily check that S 3, P 4, K,n and K Kn satisfy the equality in (3.10). Otherwise, n 5 and G K,n, G K Kn. By Lemma., we can immediately get ρ 1 (G)+ρ 1 (G) 4. Suppose that equality holds in (3.10). Then by Lemma., both G and G have at least one connected bipartite component. Without loss of generality, we can assume that G is connected. Since G is a bipartite graph with n 5, then there is at least one independent vertex subset S of V(G) with S 3. Then K 3 is an induced subgraph of G. If G is connected, then G can not be a bipartite graph, a contradiction. Otherwise, G is a disconnected graph. Then G must be complete bipartite graph K p,q and hence G = K p Kq (p+q = n). Since n 5 and ρ 1 (G) =, then p = or q =, and hence G = K,n, a contradiction. This completes the proof of the theorem. 4. Normalized Laplacian energy of starlike tree. A tree is said to be starlike if exactly one of its vertices has degree greater than two. By S(n 1, n,..., n k ) we denote the starlike tree which has a vertex v 1 of degree k 3 with n 1 n n k 1 and which has the property S(n 1, n,..., n k ) v 1 = P n1 Pn Pnk. ( This treehasn 1 +n + +n k +1 = n vertices. In particular, wehaves(,,..., ) ) = -sun, where n is odd. Let s = S ( S is the cardinality of set S) be the nonnegative integer such that S = {i : n i is odd, 1 i k. Banerjee et al. [1] proved that for starlike tree T = S(n 1, n,..., n k ), T has the matching number n s+1 (s 0). This result with Lemma.10, we get the following:
15 Volume 31, pp , December K. C. Das and S. Sun Lemma 4.1. Let T = S(n 1, n,..., n k ) be a starlike tree of order n with vertex cover number c. Then s = 0, c = n+1 s s 1. Banerjee et al. [1, Theorem. (ii)] gave a result on R 1 (T) which is not true. Here we give the correct statement: Lemma 4.. Let T = S(n 1, n,..., n k ) be a starlike tree of order n and let p be the largest positive integer such that n p > 1. Then R 1 (T) = n+1 k p ( 1 ). 4 4 k Proof. Since T is a starlike tree and n 1 n n p, we have (d 1, d j ) = (k, ) for p edges v 1 v j E(T), (d 1, d j ) = (k, 1) for k p edges v 1 v j E(T), (d i, d j ) = (, 1) for p edges v i v j E(T) and (d i, d j ) = (, ) for the remaining edges v i v j E(T). Thus R 1 (T) = v i v j E(T) 1 d i d j = p k + k p + p n k p 1 + k 4 = n+1 4 k p 4 ( 1 ). k Corollary 4.3. Let T = S(n 1, n,..., n k ) be a starlike tree of order n. Then R 1 (T) n+1 4 with equality holding if and only if n k. Proof. The proof follows directly from Lemma 4.. We now obtain the Randić energy for the special kind of starlike trees. Lemma 4.4. Let T = S(,,..., ) be a starlike tree of order n. Then RE(T) = + (n 3).
16 Volume 31, pp , December 016 Extremal graph on normalized Laplacian spectral radius and energy 51 Proof. The two normalized Laplacian eigenvalues of T are 1± multiplicity n 3 [3]. Since T is bipartite with n ρ i (T) = n, we get Hence we get the required result. i=1 { NLS(T) =, 1±,..., 1±, 1, 0. {{ n 3 with the same We are now ready to prove Conjecture 1.1 for starlike trees of odd order n. Theorem 4.5. Let T = S(n 1, n,..., n k ) be a starlike tree of order n (n is odd). Then RE(T) + (n 3) (4.1) with equality holding if and only if T = S(,,..., ). Proof. Let c be the vertex cover number of T. From the matrix L, we have n ρ 1 i = n+ = n+r 1 (T). d i d j i=1 v i v j E(T) Thus we have n n (ρ i 1) = ρ i n = R 1 (T). i=1 i=1 By Lemmas.3 and.9, we have n c c (ρ i 1) = (ρ i 1) = + (ρ i 1). i=1 i=1 i= Therefore (4.) c R 1 (T) = 1+ (ρ i 1). i= Again by Lemmas.3 and.9, we conclude that ρ c > 1. Moreover, we have n c c (4.3) RE(T) = ρ i 1 = (ρ i 1) = + (ρ i 1). i=1 i=1 i=
17 Volume 31, pp , December K. C. Das and S. Sun By Cauchy-Schwartz inequality and (4.), we have c c (4.4) (ρ i 1) (c 1) (ρ i 1) = (c 1)(R 1 (T) 1) i= i= with equality holding if and only if ρ = ρ 3 = = ρ c. Since n is odd, we have s = 0 or s. By Lemma 4.1, we get c with equality holding if and only if s = 0 or s =. Using this result with Corollary 4.3, from (4.4), we get (4.5) c i= (ρ i 1) (n 3) 4. From (4.3) and (4.5), we get the required result in (4.1). The first part of the proof is done. Suppose that equality holds in (4.1). Then all the inequalities in the above proof must be equalities. In particular, from equality in (4.4), we have ρ = ρ 3 = = ρ c. Fromequalityin(4.5)withCorollary4.3,wehaven k. Moreover,wehavec =. Again from equality in (4.5) with the above result, we get ρ = ρ 3 = = ρ c = 1+. By Lemmas.3 and.9, we conclude that the normalized Laplacian spectrum is { NLS(T) =, 1, 0, 1±,..., 1±. {{ n 3 Since n k, we have k. If k =, then T = S(,,..., ). Otherwise, 3 k <. In this case n 1 3. Without loss of generality, we can assume that the second maximum degree vertex v of degree is not adjacent to the maximum degree vertex v 1 of degree k in T. Then by Lemma.11, we have ρ (T) < 1, which is a contradiction (The inequality is strict because the diameter of T is strictly greater than the diameter of T(n, n 1, n 1, n,..., n k )). Conversely. one can see easily that the equality holds in (4.1) for S(,,..., ), by
18 Volume 31, pp , December 016 Extremal graph on normalized Laplacian spectral radius and energy 53 Lemma 4.4. Acknowledgment. The authors would like to thank anonymous referee for valuable comments which have considerably improved the presentation of this paper. REFERENCES [1] A. Banerjee and R. Mehatari. Characteristics polynomial of normalized Laplacian for trees. Applied Math. Comput., 71: , 015. [] J. A. Bondy and U. S. R. Murty. Graph Theory with Applications. Macmillan Press, New York, [3] R. O. Braga, R. R. Del-Vechio, V. M. Rodrigues, and V. Trevisan. Trees with 4 or 5 distinct normalized Laplacian eigenvalues. Linear Algebra Appl., 471: , 015. [4] M. Cavers. The normalized Laplacian matrix and general Randić index of graphs. PhD dissertation, University of Regina, 010. [5] M. Cavers, S. Fallat, and S. Kirkland. On the normalized Laplacian energy and general Randić index R 1 of graphs. Linear Algebra Appl., 433:17 190, 010. [6] H. Chen and J. Jost. Minimum vertex covers and the spectrum of the normalized Laplacian on trees. Linear Algebra Appl., 437: , 01. [7] F. K. Chung. Spectral graph theory. American Mathematical Soc., [8] K. C. Das, A. D. Güngör, and Ş. B. Bozkurt. On the normalized Laplacian eigenvalues of graphs. Ars. Comb., 118: , 015. [9] K. C. Das and S. Sorgun. On Randić energy of graphs. MATCH Commun. Math. Comput. Chem., 7:7 38, 014. [10] K. C. Das, S. Sorgun, and I. Gutman. On Randić energy. MATCH Commun. Math. Comput. Chem., 73:81 9, 015. [11] K. C. Das, S. Sorgun, and K. Xu. On Randić energy of graphs. I. Gutman, X. Li (Eds.), Energies of graphs-theory and Applications, Univ. Kragujevac, Kragujevac, 016, pp [1] K. C. Das and S. Sun. Normalized Laplacian eigenvalues and energy of trees. Taiwanese Journal of Mathematics, 0 (3): , 016. [13] B. Furtula and I. Gutman. Comparing energy and Randić energy. Maced. J. Chem. Chem. Engin., 3:117 13, 013. [14] I. Gutman, B. Furtula, and Ş. B. Bozkurt. On Randić energy. Linear Algebra Appl., 44:50 57, 014. [15] I. Gutman, M. Robbiano, and B. S. Martin Upper bound on Randić energy of some graphs. Linear Algebra Appl., 478:41 55, 015. [16] J. Li, J.-M. Guo, and W. C. Shiu. Bounds on normalized Laplacian eigenvalues of graphs. Journal Inequalities Appl., 316:1 8, 014. [17] H. Lin, M. Zhai, and S. Gong. On graphs with at least three distance eigenvalues less than -1. Linear Algebra Appl., 458: , 014. [18] D. Rautenbach. A note on trees of maximum weight and restricted degrees. Discrete Math., 71:335 34, 003.
Extremal 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 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 informationOn the Average of the Eccentricities of a Graph
Filomat 32:4 (2018), 1395 1401 https://doi.org/10.2298/fil1804395d Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat On the Average
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 informationBicyclic digraphs with extremal skew energy
Electronic Journal of Linear Algebra Volume 3 Volume 3 (01) Article 01 Bicyclic digraphs with extremal skew energy Xiaoling Shen Yoaping Hou yphou@hunnu.edu.cn Chongyan Zhang Follow this and additional
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 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 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 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 informationResolvent Energy of Graphs
Resolvent Energy of Graphs I.Gutman 1,2, B.Furtula 1, E.Zogić 2, E.Glogić 2 1 Faculty of Science, University of Kragujevac, Kragujevac, Serbia 2 State University of Novi Pazar, Novi Pazar, Serbia May 19,
More informationExtremal Laplacian-energy-like invariant of graphs with given matching number
Electronic Journal of Linear Algebra Volume 6 Volume 6 (013) Article 10 013 Extremal Laplacian-energy-like invariant of graphs with given matching number Kexiang Xu Kinkar Ch. Das kinkardas003@googlemail.com
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 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 informationThe multiplicative Zagreb indices of graph operations
Das et al Journal of Inequalities and Applications 0, 0:90 R E S E A R C H Open Access The multiplicative Zagreb indices of graph operations Kinkar C Das, Aysun Yurttas,MugeTogan, Ahmet Sinan Cevik and
More informationOn the distance spectral radius of unicyclic graphs with perfect matchings
Electronic Journal of Linear Algebra Volume 27 Article 254 2014 On the distance spectral radius of unicyclic graphs with perfect matchings Xiao Ling Zhang zhangxling04@aliyun.com Follow this and additional
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 informationNormalized rational semiregular graphs
Electronic Journal of Linear Algebra Volume 8 Volume 8: Special volume for Proceedings of Graph Theory, Matrix Theory and Interactions Conference Article 6 015 Normalized rational semiregular graphs Randall
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 informationCCO Commun. Comb. Optim.
Communications in Combinatorics and Optimization Vol. 1 No. 2, 2016 pp.137-148 DOI: 10.22049/CCO.2016.13574 CCO Commun. Comb. Optim. On trees and the multiplicative sum Zagreb index Mehdi Eliasi and Ali
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 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 informationLower bounds for the Estrada index
Electronic Journal of Linear Algebra Volume 23 Volume 23 (2012) Article 48 2012 Lower bounds for the Estrada index Yilun Shang shylmath@hotmail.com Follow this and additional works at: http://repository.uwyo.edu/ela
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 informationA note on a conjecture for the distance Laplacian matrix
Electronic Journal of Linear Algebra Volume 31 Volume 31: (2016) Article 5 2016 A note on a conjecture for the distance Laplacian matrix Celso Marques da Silva Junior Centro Federal de Educação Tecnológica
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 informationThe third smallest eigenvalue of the Laplacian matrix
Electronic Journal of Linear Algebra Volume 8 ELA Volume 8 (001) Article 11 001 The third smallest eigenvalue of the Laplacian matrix Sukanta Pati pati@iitg.ernet.in Follow this and additional works at:
More informationExtremal Zagreb Indices of Graphs with a Given Number of Cut Edges
Graphs and Combinatorics (2014) 30:109 118 DOI 10.1007/s00373-012-1258-8 ORIGINAL PAPER Extremal Zagreb Indices of Graphs with a Given Number of Cut Edges Shubo Chen Weijun Liu Received: 13 August 2009
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 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 informationRegular factors of regular graphs from eigenvalues
Regular factors of regular graphs from eigenvalues Hongliang Lu Center for Combinatorics, LPMC Nankai University, Tianjin, China Abstract Let m and r be two integers. Let G be a connected r-regular graph
More informationTHE MINIMUM MATCHING ENERGY OF BICYCLIC GRAPHS WITH GIVEN GIRTH
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 46, Number 4, 2016 THE MINIMUM MATCHING ENERGY OF BICYCLIC GRAPHS WITH GIVEN GIRTH HONG-HAI LI AND LI ZOU ABSTRACT. The matching energy of a graph was introduced
More informationA characterization of diameter-2-critical graphs with no antihole of length four
Cent. Eur. J. Math. 10(3) 2012 1125-1132 DOI: 10.2478/s11533-012-0022-x Central European Journal of Mathematics A characterization of diameter-2-critical graphs with no antihole of length four Research
More informationPotentially nilpotent tridiagonal sign patterns of order 4
Electronic Journal of Linear Algebra Volume 31 Volume 31: (2016) Article 50 2016 Potentially nilpotent tridiagonal sign patterns of order 4 Yubin Gao North University of China, ybgao@nuc.edu.cn Yanling
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 informationSHARP BOUNDS FOR THE GENERAL RANDIĆ INDEX R 1 OF A GRAPH
ROCKY MOUNTAIN JOURNAL OF MATHEMATICS Volume 47, Number, 207 SHARP BOUNDS FOR THE GENERAL RANDIĆ INDEX R OF A GRAPH EI MILOVANOVIĆ, PM BEKAKOS, MP BEKAKOS AND IŽ MILOVANOVIĆ ABSTRACT Let G be an undirected
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 informationExtremal trees with fixed degree sequence for atom-bond connectivity index
Filomat 26:4 2012), 683 688 DOI 10.2298/FIL1204683X Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Extremal trees with fixed degree
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 informationSpectra and Randić Spectra of Caterpillar Graphs and Applications to the Energy
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 77 07) 6-75 ISSN 0340-653 Spectra and Randić Spectra of Caterpillar Graphs and Applications to the Energy
More informationarxiv: v1 [math.co] 5 Sep 2016
Ordering Unicyclic Graphs with Respect to F-index Ruhul Amin a, Sk. Md. Abu Nayeem a, a Department of Mathematics, Aliah University, New Town, Kolkata 700 156, India. arxiv:1609.01128v1 [math.co] 5 Sep
More informationCopies of a rooted weighted graph attached to an arbitrary weighted graph and applications
Electronic Journal of Linear Algebra Volume 26 Volume 26 2013 Article 47 2013 Copies of a rooted weighted graph attached to an arbitrary weighted graph and applications Domingos M. Cardoso dcardoso@ua.pt
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 informationNOTE ON THE SKEW ENERGY OF ORIENTED GRAPHS. Communicated by Ivan Gutman. 1. Introduction
Transactions on Combinatorics ISSN (print): 2251-8657, ISSN (on-line): 2251-8665 Vol. 4 No. 1 (2015), pp. 57-61. c 2015 University of Isfahan www.combinatorics.ir www.ui.ac.ir NOTE ON THE SKEW ENERGY OF
More informationEigenvalues and edge-connectivity of regular graphs
Eigenvalues and edge-connectivity of regular graphs Sebastian M. Cioabă University of Delaware Department of Mathematical Sciences Newark DE 19716, USA cioaba@math.udel.edu August 3, 009 Abstract In this
More informationExtremal graphs for the sum of the two largest signless Laplacian eigenvalues
Electronic Journal of Linear Algebra Volume 30 Volume 30 (2015) Article 41 2015 Extremal graphs for the sum of the two largest signless Laplacian eigenvalues Carla Silva Oliveira Escola Nacional de Ciencias
More informationCCO Commun. Comb. Optim.
Communications in Combinatorics and Optimization Vol. 3 No., 018 pp.179-194 DOI: 10.049/CCO.018.685.109 CCO Commun. Comb. Optim. Leap Zagreb Indices of Trees and Unicyclic Graphs Zehui Shao 1, Ivan Gutman,
More informationBulletin T.CXXII de l Académie Serbe des Sciences et des Arts Classe des Sciences mathématiques et naturelles Sciences mathématiques, No 26
Bulletin T.CXXII de l Académie Serbe des Sciences et des Arts - 001 Classe des Sciences mathématiques et naturelles Sciences mathématiques, No 6 SOME SPECTRAL PROPERTIES OF STARLIKE TREES M. LEPOVIĆ, I.
More informationSparse spectrally arbitrary patterns
Electronic Journal of Linear Algebra Volume 28 Volume 28: Special volume for Proceedings of Graph Theory, Matrix Theory and Interactions Conference Article 8 2015 Sparse spectrally arbitrary patterns Brydon
More informationOn the normalized Laplacian energy and general Randić index R 1 of graphs
On the normalized Laplacian energy and general Randić index R of graphs Michael Cavers a Shaun Fallat a Steve Kirkland ab3 a Department of Mathematics and Statistics University of Regina Regina SK Canada
More informationMaximum Size of Maximally Irregular Graphs
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 76 (2016) 81-98 ISSN 0340-6253 Maximum Size of Maximally Irregular Graphs Batmend Horoldagva 1,2,, Lkhagva
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 informationExtremal Topological Indices for Graphs of Given Connectivity
Filomat 29:7 (2015), 1639 1643 DOI 10.2298/FIL1507639T Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://www.pmf.ni.ac.rs/filomat Extremal Topological Indices
More informationarxiv: v1 [math.co] 30 Dec 2015
Resolvent Energy of Unicyclic, Bicyclic and Tricyclic Graphs arxiv:1512.08938v1 [math.co] 30 Dec 2015 Luiz Emilio Allem 1, Juliane Capaverde 1, Vilmar Trevisan 1, Abstract Ivan Gutman 2,3, Emir Zogić 3,
More informationRefined Inertia of Matrix Patterns
Electronic Journal of Linear Algebra Volume 32 Volume 32 (2017) Article 24 2017 Refined Inertia of Matrix Patterns Kevin N. Vander Meulen Redeemer University College, kvanderm@redeemer.ca Jonathan Earl
More informationGraphs with Integer Matching Polynomial Roots
Graphs with Integer Matching Polynomial Roots S. Akbari a, P. Csikvári b, A. Ghafari a, S. Khalashi Ghezelahmad c, M. Nahvi a a Department of Mathematical Sciences, Sharif University of Technology, Tehran,
More information(Received: 19 October 2018; Received in revised form: 28 November 2018; Accepted: 29 November 2018; Available Online: 3 January 2019)
Discrete Mathematics Letters www.dmlett.com Discrete Math. Lett. 1 019 1 5 Two upper bounds on the weighted Harary indices Azor Emanuel a, Tomislav Došlić b,, Akbar Ali a a Knowledge Unit of Science, University
More informationAverage distance, radius and remoteness of a graph
Also available at http://amc-journal.eu ISSN 855-3966 (printed edn.), ISSN 855-397 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 7 (0) 5 Average distance, radius and remoteness of a graph Baoyindureng
More informationOn the mean connected induced subgraph order of cographs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 71(1) (018), Pages 161 183 On the mean connected induced subgraph order of cographs Matthew E Kroeker Lucas Mol Ortrud R Oellermann University of Winnipeg Winnipeg,
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 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 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 informationAverage Mixing Matrix of Trees
Electronic Journal of Linear Algebra Volume 34 Volume 34 08 Article 9 08 Average Mixing Matrix of Trees Chris Godsil University of Waterloo, cgodsil@uwaterloo.ca Krystal Guo Université libre de Bruxelles,
More informationNote on deleting a vertex and weak interlacing of the Laplacian spectrum
Electronic Journal of Linear Algebra Volume 16 Article 6 2007 Note on deleting a vertex and weak interlacing of the Laplacian spectrum Zvi Lotker zvilo@cse.bgu.ac.il Follow this and additional works at:
More informationA note on estimates for the spectral radius of a nonnegative matrix
Electronic Journal of Linear Algebra Volume 13 Volume 13 (2005) Article 22 2005 A note on estimates for the spectral radius of a nonnegative matrix Shi-Ming Yang Ting-Zhu Huang tingzhuhuang@126com Follow
More informationOn the difference between the revised Szeged index and the Wiener index
On the difference between the revised Szeged index and the Wiener index Sandi Klavžar a,b,c M J Nadjafi-Arani d June 3, 01 a Faculty of Mathematics and Physics, University of Ljubljana, Slovenia sandiklavzar@fmfuni-ljsi
More informationOn oriented graphs with minimal skew energy
Electronic Journal of Linear Algebra Volume 7 Article 61 014 On oriented graphs with minimal skew energy Shi-Cai Gong Zhejiang A & F University, scgong@zafueducn Xueliang Li Nankai University, lxl@nankaieducn
More informationOn the Feichtinger conjecture
Electronic Journal of Linear Algebra Volume 26 Volume 26 (2013) Article 35 2013 On the Feichtinger conjecture Pasc Gavruta pgavruta@yahoo.com Follow this and additional works at: http://repository.uwyo.edu/ela
More informationJournal of Mathematical Nanoscience. On borderenergetic and L-borderenergetic graphs
Journal of Mathematical Nanoscienese 7 (2) (2017) 71 77 Journal of Mathematical Nanoscience Available Online at: http://jmathnano.sru.ac.ir On borderenergetic and L-borderenergetic graphs Mardjan Hakimi-Nezhaad
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 informationOn Hadamard Diagonalizable Graphs
On Hadamard Diagonalizable Graphs S. Barik, S. Fallat and S. Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A2 Abstract Of interest here is a characterization
More informationEnergy and Laplacian Energy of Graphs. ALI REZA ASHRAFI Department of Mathematics, University of Kashan, Kashan , I. R.
Energy and Laplacian Energy of Graphs ALI REZA ASHRAFI Department of Mathematics, University of Kashan, Kashan 87317-51167, I. R. Iran E-mail: ashrafi@kashanu.ac.ir Contents Laplacian Matrix Laplacian
More informationarxiv: v1 [math.co] 6 Feb 2011
arxiv:1102.1144v1 [math.co] 6 Feb 2011 ON SUM OF POWERS OF LAPLACIAN EIGENVALUES AND LAPLACIAN ESTRADA INDEX OF GRAPHS Abstract Bo Zhou Department of Mathematics, South China Normal University, Guangzhou
More informationIn this paper, we will investigate oriented bicyclic graphs whose skew-spectral radius does not exceed 2.
3rd International Conference on Multimedia Technology ICMT 2013) Oriented bicyclic graphs whose skew spectral radius does not exceed 2 Jia-Hui Ji Guang-Hui Xu Abstract Let S(Gσ ) be the skew-adjacency
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 informationDistance spectral radius of trees with fixed maximum degree
Electronic Journal of Linear Algebra Volume 20 Volume 20 (200) Article 3 200 Distance spectral radius of trees with fixed maximum degree Dragan Stevanovic Aleksandar Ilic aleksandari@gmail.com Follow this
More informationSmall Cycle Cover of 2-Connected Cubic Graphs
. Small Cycle Cover of 2-Connected Cubic Graphs Hong-Jian Lai and Xiangwen Li 1 Department of Mathematics West Virginia University, Morgantown WV 26505 Abstract Every 2-connected simple cubic graph of
More informationIntroduction to Domination Polynomial of a Graph
Introduction to Domination Polynomial of a Graph arxiv:0905.2251v1 [math.co] 14 May 2009 Saeid Alikhani a,b,1 and Yee-hock Peng b,c a Department of Mathematics Yazd University 89195-741, Yazd, Iran b Institute
More informationDECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE
Discussiones Mathematicae Graph Theory 30 (2010 ) 335 347 DECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE Jaroslav Ivančo Institute of Mathematics P.J. Šafári University, Jesenná 5 SK-041 54
More informationLocating-Total Dominating Sets in Twin-Free Graphs: a Conjecture
Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture Florent Foucaud Michael A. Henning Department of Pure and Applied Mathematics University of Johannesburg Auckland Park, 2006, South Africa
More informationOn cardinality of Pareto spectra
Electronic Journal of Linear Algebra Volume 22 Volume 22 (2011) Article 50 2011 On cardinality of Pareto spectra Alberto Seeger Jose Vicente-Perez Follow this and additional works at: http://repository.uwyo.edu/ela
More informationOn the Adjacency Spectra of Hypertrees
On the Adjacency Spectra of Hypertrees arxiv:1711.01466v1 [math.sp] 4 Nov 2017 Gregory J. Clark and Joshua N. Cooper Department of Mathematics University of South Carolina November 7, 2017 Abstract We
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 informationThe smallest Randić index for trees
Proc. Indian Acad. Sci. (Math. Sci.) Vol. 123, No. 2, May 2013, pp. 167 175. c Indian Academy of Sciences The smallest Randić index for trees LI BINGJUN 1,2 and LIU WEIJUN 2 1 Department of Mathematics,
More informationSang Gu Lee and Jeong Mo Yang
Commun. Korean Math. Soc. 20 (2005), No. 1, pp. 51 62 BOUND FOR 2-EXPONENTS OF PRIMITIVE EXTREMAL MINISTRONG DIGRAPHS Sang Gu Lee and Jeong Mo Yang Abstract. We consider 2-colored digraphs of the primitive
More informationBulletin of the Iranian Mathematical Society
ISSN: 117-6X (Print) ISSN: 1735-8515 (Online) Bulletin of the Iranian Mathematical Society Vol. 4 (14), No. 6, pp. 1491 154. Title: The locating chromatic number of the join of graphs Author(s): A. Behtoei
More informationLAPLACIAN ESTRADA INDEX OF TREES
MATCH Communications in Mathematical and in Computer Chemistry MATCH Commun. Math. Comput. Chem. 63 (009) 769-776 ISSN 0340-653 LAPLACIAN ESTRADA INDEX OF TREES Aleksandar Ilić a and Bo Zhou b a Faculty
More informationRegular graphs with a small number of distinct eigenvalues
Regular graphs with a small number of distinct eigenvalues Tamara Koledin UNIVERZITET U BEOGRADU ELEKTROTEHNIČKI FAKULTET This is joint work with Zoran Stanić Bipartite regular graphs Bipartite regular
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 star forest ascending subgraph decomposition
On star forest ascending subgraph decomposition Josep M. Aroca and Anna Lladó Department of Mathematics, Univ. Politècnica de Catalunya Barcelona, Spain josep.m.aroca@upc.edu,aina.llado@upc.edu Submitted:
More informationOn maximum Estrada indices of bipartite graphs with some given parameters
arxiv:1404.5368v1 [math.co] 22 Apr 2014 On maximum Estrada indices of bipartite graphs with some given parameters Fei Huang, Xueliang Li, Shujing Wang Center for Combinatorics and LPMC-TJKLC Nankai University,
More informationAll Ramsey numbers for brooms in graphs
All Ramsey numbers for brooms in graphs Pei Yu Department of Mathematics Tongji University Shanghai, China yupeizjy@16.com Yusheng Li Department of Mathematics Tongji University Shanghai, China li yusheng@tongji.edu.cn
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 information2-bondage in graphs. Marcin Krzywkowski*
International Journal of Computer Mathematics Vol. 00, No. 00, January 2012, 1 8 2-bondage in graphs Marcin Krzywkowski* e-mail: marcin.krzywkowski@gmail.com Department of Algorithms and System Modelling
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 informationBOUNDS 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 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 informationSKEW-SPECTRA AND SKEW ENERGY OF VARIOUS PRODUCTS OF GRAPHS. Communicated by Ivan Gutman
Transactions on Combinatorics ISSN (print: 2251-8657, ISSN (on-line: 2251-8665 Vol. 4 No. 2 (2015, pp. 13-21. c 2015 University of Isfahan www.combinatorics.ir www.ui.ac.ir SKEW-SPECTRA AND SKEW ENERGY
More informationGroup connectivity of certain graphs
Group connectivity of certain graphs Jingjing Chen, Elaine Eschen, Hong-Jian Lai May 16, 2005 Abstract Let G be an undirected graph, A be an (additive) Abelian group and A = A {0}. A graph G is A-connected
More informationOn the edge cover polynomial of a graph
On the edge cover polynomial of a graph Saieed Akbari a,b, Mohammad Reza Oboudi a,b a Department of Mathematical Sciences, Sharif University of Technology, P.O. Box 11155-9415, Tehran, Iran b School of
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 information