On the distance signless Laplacian spectral radius of graphs and digraphs
|
|
- Hortense Cain
- 6 years ago
- Views:
Transcription
1 Electronic Journal of Linear Algebra Volume 3 Volume 3 (017) Article On the distance signless Laplacian spectral radius of graphs and digraphs Dan Li Xinjiang University,Urumqi, ldxjedu@163.com Guoping Wang Xinjiang Normal University,Urumqi, xj.wgp@163.com Jixiang Meng Xinjiang University, Urumqi, mjxxju@sina.com Follow this and additional works at: Part of the Discrete Mathematics and Combinatorics Commons Recommended Citation Li, Dan; Wang, Guoping; and Meng, Jixiang. (017), "On the distance signless Laplacian spectral radius of graphs and digraphs", Electronic Journal of Linear Algebra, Volume 3, 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 3, pp , December 017. ON THE DISTANCE SIGNLESS LAPLACIAN SPECTRAL RADIUS OF GRAPHS AND DIGRAPHS DAN LI, GUOPING WANG, AND JIXIANG MENG Abstract. Let η(g) denote the distance signless Laplacian spectral radius of a connected graph G. In this paper, bounds for the distance signless Laplacian spectral radius of connected graphs are given, and the extremal graph with the minimal distance signless Laplacian spectral radius among the graphs with given vertex connectivity and minimum degree is determined. Furthermore, the digraph that minimizes the distance signless Laplacian spectral radius with given vertex connectivity is characterized. Key words. Distance signless Laplacian spectral radius, Bound, Extremal graph, Digraph, Vertex connectivity. AMS subject classifications. 05C Introduction. In this paper, we consider simple and connected graphs. Let G be a simple graph with vertex set V (G) = {v 1, v,..., v n } and edge set E(G). Let d i be the degree of the vertex v i in G for i = 1,..., n. Let A(G) = (a ij ) n n be the (0, 1)-adjacency matrix of G, where a ij = 1 if v i v j E(G) and a ij = 0 otherwise. Let (G) = diag(d 1,..., d n ) be the diagonal degree matrix. Then Q(G) = (G) + A(G) is the signless Laplacian matrix of G. Let D(G) = (d ij ) n n be the distance matrix of a connected graph G, where d ij = d G (v i, v j ) is defined to be the length of shortest path between v i and v j. We call D i = n j=1 d ij the transmission of vertex v i (i = 1,,..., n). The matrix D Q (G) = Diag(T r) + D(G) is the distance signless Laplacian matrix of G (D Q -matrix), where Diag(T r) is the diagonal matrix whose ith diagonal entry is D i. The matrix D Q (G) is nonnegative and irreducible when G is connected. The largest eigenvalue of D Q (G) is called distance signless Laplacian spectral radius of the graph G. The distance spectral radius of a connected graph has been studied extensively. Chen, Lin and Shu [4] obtained sharp upper bounds on the distance spectral radius of a graph. Indulal [7] gave some bounds for the distance spectral radius of graphs. Ilić [6] obtained the tree with given matching number that minimizes the distance spectral radius. Bose, Nath and Paul [3] determined the unique graph with maximal distance spectral radius in the class of graphs without a pendent vertex. Lin, Yang, Zhang and Shu [10] characterized the extremal digraph with the minimal distance spectral radius among all digraphs with given vertex connectivity and the extremal graph with the minimal distance spectral radius among all graphs with given edge connectivity. Aouchiche and Hansen [1] introduced the distance Laplacian and distance signless Laplacian spectra of graphs, respectively. Lin and Lu [9] found a sharp lower bound as well as a sharp upper bound of the distance signless Laplacian spectral radius in terms of the clique number. Furthermore, both extremal graphs are Received by the editors on June 7, 017. Accepted for publication on November 13, 017. Handling Editor: Ravi Bapat. College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang , China (ldxjedu@163.com, mjxxju@sina.com). School of Mathematical Sciences, Xinjiang Normal University, Urumqi, Xinjiang , China (xj.wgp@163.com).
3 Volume 3, pp , December On the Distance Signless Laplacian Spectral Radius of Graphs and Digraphs uniquely determined. Hong and You [5] obtained some sharp bounds on the distance signless Laplaciqan spectral radius of graphs. Xing and Zhou [11] gave the unique graphs with minimum distance and distance signless Laplacian spectral radius among bicyclic graphs with fixed number of vertices. Xing, Zhou and Li [1] determined the graphs with minimum distance signless Laplacian spectral radius among the trees, unicyclic graphs, bipartite graphs, the connected graphs with fixed pendant vertices and fixed connectivity, respectively. In this paper, we obtain the bounds for the distance signless Laplacian spectral radius of graphs and determine the extremal graph with the minimum distance signless Laplacian spectral radius among the graphs with given vertex connectivity and minimum degree. Furthermore, we characterize the digraph that minimizes the distance signless Laplacian spectral radius with given vertex connectivity.. Bounds on the distance signless Laplacian spectral radius of graphs. Let G be a graph. We denote the distance signless Laplacian spectral radius of G by η(g). A graph G is transmission regular if D 1 = D = = D n. Lemma.1. [5] Let G be a connected graph on n vertices. Then min{d i : 1 i n} η(g) max{d i : 1 i n}. Moreover, one of the equalities holds if and only if G is a transmission regular graph. Let G be a graph on n vertices. It was shown in [11] that η(g) n G is transmission regular. Note that 1 n ( n Di D i ) D1. Then +D + +D n n n better lower bound of η(g). Theorem.. Let G be a graph on n vertices. Then η(g) if G is transmission regular. Proof. Let x = 1 n (1, 1,..., 1). Then η(g) x(d Q (G)) x T. D i with equality if and only if D i. Thus, the following result gives a D 1 +D + +D n n with equality if and only Note that xd Q (G) = 1 n (1, 1,..., 1)D Q (G) = n (D 1, D,..., D n ). We have D1 Thus, η(g) +D + +D n n. x(d Q (G)) x T = xd Q (G)(xD Q (G)) T = 4 n If G is transmission regular, then by Lemma.1, η(g) = D i = Di. 1 n Di. Conversely, if equality holds, then x is the eigenvector corresponding to η(g), i.e., D Q (G)x T = η(g)x T. This implies that D i = η(g)/ (i = 1,,..., n).
4 Volume 3, pp , December 017. Dan Li, Guoping Wang, and Jixiang Meng 440 Let ρ(g) be the distance spectral radius of the graph G. If G is transmission regular, then ρ(g) = D i. Thus, we have the following. Corollary.3. Suppose that G is transmission regular. Then η(g) = ρ(g). A graph G is regular if d 1 = = d n. Lemma.4. Let G be a connected graph with diameter d. Then G is regular if and only if G is transmission regular. Proof. If d = 1, then G = K n. If d =, then D i = d i + (n 1 d i ) = n d i, from which we can see that G is regular if and only if G is transmission regular. The unit eigenvector x(g) = (x 1, x,..., x n ) T > 0 corresponding to η(g) is called the Perron vector of D Q (G). Theorem.5. Let G be a graph on n vertices with maximum degree 1 and second maximum degree. Then η(g) 4n 4 1 with equality if and only if G is a regular graph with diameter d. Proof. Let x = (x 1, x,..., x n ) T be a Perron eigenvector of D Q (G) such that x i = min 1 k n x k and x j = min 1 k i n x k. From D Q (G)x = η(g)x, we obtain that Note that Then we can get that η(g)x i = D i x i + η(g)x j = D j x j + D i = D j = k=1,k i k=1,k j k=1,k i k=1,k j d ik x k D i (x i + x j ); d jk x k D j (x i + x j ). d ik d i + (n 1 d i ) = n d i ; d jk d j + (n 1 d j ) = n d j. (.1) η(g)x i (n d i )(x i + x j ) and (.) η(g)x j (n d j )(x i + x j ). Therefore, by (.1) and (.), we have that is η(g)(x i + x j ) (4n 4 d i d j )(x i + x j ) (4n 4 1 )(x i + x j ), η(g) 4n 4 1. If the equality holds, then we deduce that G is a regular graph with diameter d and all x i are equal. If d = 1, then G = K n. If d =, then we get η(g)x i = (d i + (n 1 d i ))x i, i.e., η(g) = (n d i ), which implies that G is a regular graph. Conversely, by Lemma.4, we can get that η(g) = (n 1 ) if G is a regular graph with diameter d.
5 Volume 3, pp , December On the Distance Signless Laplacian Spectral Radius of Graphs and Digraphs Theorem.6. Let G be a graph on n vertices with minimum degree δ 1 and second minimum degree δ. Then η(g) dn d(d 1) (d 1)(δ 1 + δ ) with equality if and only if G is a regular graph with diameter d. Proof. Let x = (x 1, x,..., x n ) T be a Perron eigenvector of D Q (G) such that x s = max 1 k n x k and x t = max 1 k s n x k. From D Q (G)x = η(g)x, we obtain that Note that Thus, D s = k=1,k s η(g)x s = D s x s + η(g)x t = D t x t + k=1,k s k=1,k t d sk x k D s (x s + x t ); d tk x k D t (x s + x t ). d sk d s d 1 + d[n 1 d s (d )] = dn (.3) η(g)x s [dn Similarly, we can get that (.4) η(g)x t [dn Therefore, by (.3) and (.4), we have d(d 1) d(d 1) 1 d s (d 1)](x s + x t ). 1 d t (d 1)](x s + x t ). d(d 1) η(g)(x s + x t ) [dn d(d 1) (d 1)(d s + d t )](x s + x t ), from which we obtain that η(g) dn d(d 1) (d 1)(δ 1 + δ ). 1 d s (d 1). If the equality holds, then all x i are equal, and hence, D Q (G) has equal row sums. Therefore, G is transmission regular. If d 3, then by (.3), we know that for each vertex v i, there is exactly one vertex v j such that d ij =, and then d < 4. If the diameter of G is 3 and equality holds, then for a center vertex v s, from D Q (G)x = η(g)x and (.3), written for the component x s, we have η(g)x s = D s x s + d s x s + (n 1 d s )x s = (n d s )x s = (3n 4 d s )x s, and thus, d s = n, which implies that G = P 4, but P 4 is not transmission regular, a contradiction. Therefore, G is a regular graph with diameter d. Conversely, by Lemma.4, we can get that η(g) = (n δ 1 ) if G is a regular graph with diameter d. 3. The minimal distance signless Laplacian spectral radius for graphs with given vertex connectivity and minimum degree. The vertex connectivity of a graph G is the minimum number of vertices, whose deletion results in a disconnected or a trivial graph. The join G 1 + G of two graphs G 1 (V 1, E 1 ) and G (V, E ) consists of the union G 1 G of G 1 and G and all edges joining V 1 with V. Let
6 Volume 3, pp , December 017. Dan Li, Guoping Wang, and Jixiang Meng 44 G k,n be the class of all graphs of order n with vertex connectivity κ(g) k n 1 and minimum degree δ k. Let G k,δ,n = K k + (K δ k+1 K n δ 1 ). Obviously, G k,δ,n G k,n. For fixed n and k, let g(n 1, n ) = x 3 a 1 x a x + a 3, where a 1 = 4n + n 1 + n 6, a = (n 1 + n )(0 13k) 8(n + n 1) 1(n 1 n + 1) 5k + 16k, and a 3 = k 3 + (10 8n 8n 1 )k + ( n + 6n 1 10n 10n 1 16n 1 n )k 4((n ) + (n 1 ) + (n 1 + n )(n 1 n + 1) + (3n 1 n + 1)). Lemma 3.1. η = η(k k + (K n1 K n )) satisfies the equation g(n 1, n ) = 0. Proof. Let x be the Perron vector of D Q (K k + (K n1 K n ). It is clear that x can be written as From D Q (K k + (K n1 K n )x = ηx, we have x = (x,..., x, y,..., y, z,..., z) T. }{{}}{{}}{{} n 1 k n ηx = (n 1 + n + k )x + ky + n z; ηy = n 1 x + (n 1 + n + k )y + n z; ηz = n 1 x + ky + (n 1 + n + k )z. This shows that η is an eigenvalue of the matrix A, where n 1 + n + k k n A = n 1 n 1 + n + k n, n 1 k n 1 + n + k and det(ix A) = g(n 1, n ) = x 3 a 1 x a x + a 3. This shows that the result is true. By Lemma 3.1 we can immediately get the following corollary. Corollary 3.. Spectral radius of G k,δ,n is the largest root of the equation x 3 (5n k 6)x ( 4δ + (4k + 4n 8)δ nk 8n + 4n 16)x + (( 1k + 8n + 16)δ + (1k + 4kn 8n 40k + 3)δ 4k 3 kn 8k + 54kn 1n 56k + 4n 4) = 0. Lemma 3.3. If n n 1, then η(k k + (K n1 K n )) > η(k k + (K n1 1 K n+1)). Proof. Let h(λ) = g n1,n (λ) g n1 1,n +1(λ) = 4(n n 1 + 1)λ + 4(k(n n 1 + 1) + (n n 1 )(n + n 1 1) + (n 1 1)). Then λ 0 = k + (n n1)(n+n1 1) n n (n1 1) n n 1+1 is the root of the equation h(λ) = 0. By Lemma.1, we know that η(k k +(K n1 K n )) (n +n 1 1)+k and η(k k +(K n1 1 K n+1)) (n + n 1 1) + k. And, (n + n k) λ 0 = (n + n 1 1) + k (n n 1 )(n + n 1 1) n n = (n 1 1) n n ( 1 n ) n 1 (n + n 1 1) + (n 1)(n n 1 + 1) n 1 + > 0. n n n n Thus, η(k k + (K n1 K n )) > λ 0 and η(k k + (K n1 1 K n+1)) > λ 0. Since h(λ) is a decreasing function of λ, g n1,n (λ) g n1 1,n +1(λ) < 0 for λ > λ 0, which yields η(k k +(K n1 K n )) > η(k k +(K n1 1 K n+1)).
7 Volume 3, pp , December On the Distance Signless Laplacian Spectral Radius of Graphs and Digraphs Lemma 3.4. [11] Let G be a connected graph with u, v V (G) and uv / E(G). Then η(g) > η(g+uv). Theorem 3.5. Among all the connected graphs of order n with connectivity at most k and minimum degree δ, G k,δ,n uniquely minimizes the distance signless Laplacian spectral radius. Proof. The case k = n 1 is trivial, and so we assume that k n. Let G be a graph in G k,n with the minimum distance signless Laplacian spectral radius, and S be a k-vertex cut of G. Now we verify the following two claims. Claim 1. G S consists exactly of two components. Suppose to the contrary that G S contains G 1, G and G 3. Then there must be u G and v G 3 such that uv E(G). Thus, by Lemma 3.4, η(g) > η(g + uv) while G + uv G k,n. This contradiction shows that G S = G 1 G. Claim. G i and G[V (G i ) S] (i = 1, ) are all complete graphs. If there is uv / E(G i ), then G+uv G k,n. By Lemma 3.4, η(g) > η(g+uv), a contradiction. Similarly, G[V (G i ) S] is also a complete graphs. By the above argument we can determine that G = K k +(K n1 K n ). Since δ k, we have n i δ k+1. If n 1 δ k +, without loss of generality, we suppose n n 1, then η(g) > η(k k + (K n1 1 K n+1)) while K k + (K n1 1 K n+1) G k,n by Lemma 3.3. This contradiction shows that n 1 = δ k + 1 and n = n δ 1, that is, G = G k,δ,n. Let C(n, k) be the set of connected graphs with n vertices and connectivity k, where 1 k n, then the following result can be obtained immediately. Corollary 3.6. [1] Let G C(n, k),where 1 k n. Then, η(g) η(k k + (K 1 K n k 1 )) with equality if and only if G = K k + (K 1 K n k 1 ). 4. The minimal distance signless Laplacian spectral radius for digraphs with given vertex connectivity. Similar to undirected graph, we use D( G) = (d ij ) n n and D Q ( G) = Diag(T r) + D( G) to denote the distance matrix and distance signless Laplacian matrix of G, respectively, where d ij = d G (v i, v j ) denote the length of shortest dipath from v i to v j in G and Diag(T r) is the diagonal matrix with D i. Clearly, the matrix D Q ( G) is irreducible when G is strongly connected. The eigenvalue of D Q ( G) with the largest modulus is the distance signless Laplacian spectral radius of G, denoted by η( G). For a strongly connected digraph G = (V ( G), E( G)), a set of vertices S V ( G) is a vertex cut if G S is not strongly connected. The vertex connectivity of G, denoted by κ( G), is the minimum number of vertices whose deletion yields the resulting digraph non-strongly connected. In this section, we characterize the digraph that minimizes the distance signless Laplacian spectral radius with given vertex connectivity. Let D n,k denote the set of strongly connected digraphs with order n and vertex connectivity κ( G) = k. If k = n 1, then D n,n 1 = { K n }. Thus, we only need to discuss the cases 1 k n. Let G 1 G denote the digraph obtained from two disjoint digraphs G 1, G with vertex set V ( G 1 ) V ( G ) and arc set E = E( G 1 ) E( G ) {(u, v), (v, u) u V ( G 1 ), v V ( G )}. Let 1 κ n, and K k,s n s denote the digraphs K k ( K s K n k s ) E 1, where E 1 = {(u, v) u V ( K s ), v V ( K n k s )}. Let K n,k = { K k,s n s 1 s n s 1}. A digraph G is a minimizing digraph of D n,k if G D n,k and η( G) = min{η( G) G D n,k }.
8 Volume 3, pp , December 017. Dan Li, Guoping Wang, and Jixiang Meng 444 Let J a b be the a b matrix whose entries are all equal to 1, I n be the n n unit matrix and A( G) be the arc set of digraph G. Lemma 4.1. [] Let G be an arbitrary strongly connected digraph with vertex connectivity k. Suppose that S is a k-vertex cut of G and G 1,..., G s are the strongly connected components of G S. Then there exists an ordering of G 1,..., G s such that, for 1 i s and v V ( G i ), every tail of v in G 1,..., G i. Lemma 4.. [8] Let G be a strongly connected digraph with u, v V ( G) and uv / A( G). η( G) > η( G + uv). By Lemma 4.1, we know that there exists a strongly connected component of G S, say G 1, such that no vertex of V ( G 1 ) has in-neighbors in G S G 1. Let G 1 = G S G 1. Next, we construct a new digraph H by adding to G any legal arcs from G[V ( G 1 )] to G[V ( G 1 )] G[V ( G 1 )] or any legal arcs from G[V ( G1 )] to G[V ( G 1 )] that were not present in G. Obviously, H is also k-connected and H K k,s n s. Therefore, by Lemma 4., we have the digraphs which achieve the minimum distance signless Laplacian spectral radius among all digraphs in D n,k must be in K n,k. Theorem 4.3. The digraph K k,1 n 1 is the minimizing digraph among all digraphs in K k,s n s. Furthermore, if G D n,k, then η( G) 3n + 1+ n +6n 8k 7 with equality if and only if G = K k,1 n 1. Proof. Let G be an arbitrary digraph in K k,s n s and S be a k-vertex cut of G. Suppose that G 1, G (with V ( G 1 ) = n 1 and V ( G 1 ) = n = n k n 1, respectively) are two strongly connected components of G S and with arcs E = {u 1 u E u 1 V ( G 1 ), u V ( G )}. Clearly, 1 n 1 n k 1. Let D Q ( G) be the distance signless Laplacian matrix of G. Then D Q ( G) = J n1 n 1 + (n )I n1 J n1 k J n1 n J k n1 J k k + (n )I k J k n J n n 1 J n k J n n + (n + n 1 )I n1 Then and where f(λ) = Thus, P DQ ( G) = λi n D Q ( G) = (λ n + ) n1+k (λ n n 1 + ) n 1 f(λ), λ n n 1 + k n n 1 λ n k + n n 1 k λ n n 1 n +. P DQ ( = (λ n + G) )n1+k 1 (λ n n 1 + ) n 1 [λ + ( k n n 1 n + 4)λ + n(k + n 1 + n ) + (k + n n )n 1 + n + n 1 4n k 4n 1 n + 4] = (λ n + ) n1+k 1 (λ n n 1 + ) n 1 [λ + ( 3n n 1 + 4)λ + kn 1 + n + n 1 6n n 1 + 4]. Obviously, and 3n + n 1 + (k + n ) + 8n 1 n > n 3n + n 1 + (k + n ) + 8n 1 n > n + n 1.
9 Volume 3, pp , December On the Distance Signless Laplacian Spectral Radius of Graphs and Digraphs Thus, η( G) = 3n + n 1 + (k + n ) + 8n 1 n. Since n = n k n 1, we can assume that and (f(n 1 )) (n 1 ) η( G) = f(n 1 ) = 3n + n 1 + 7n 1 + (6n 8k)n 1 + n ( 8k + 6n 14n 1 ) 7 = 8( 8kn 1 + n + 6nn 1 7n 1 ) 3 8kn 1 + n + 6nn 1 7n 1 < 0. For fixed n and k, we can assume that n > k+ since in case n = k+ there is only one value of n 1 under consideration. Since (f(n 1)) (n 1) < 0, the function f(n 1 ) is a convex function with respect to n 1. Combining f(n 1 ) > 0 for 1 n 1 n k 1, we know that the minimal value of η( G) must be taken at either n 1 = 1 or at n 1 = n k 1. Let g(x) = 7x + (6n 8k)x + n, then β = g(1) = (n + 7)(n 1) 8k > 0 and α = g(n k 1) = (k 3) + 8(n ) > 0. Then f(n k 1) f(1) = n k + α β = 1 ( (n k ) 1 n + k ). α + β If f(n k 1) f(1) 0, then we can get that { α + β n + k, α β n + k +. By the above inequalities, we have α (k + 1) which reduces to n k + 1, a contradiction. Thus, f(n k 1) f(1) > 0, i.e., η( K k,n k 1 k+1 ) > η( K k,1 n 1 ) and η( G) η( K k,1 n 1 ) = 3n + 1+ n +6n 8k 7 with equality if and only if G = K k,1 n 1. Acknowledgment. The authors are grateful to the anonymous referees for their valuable comments and helpful suggestions, which have considerably improved the presentation of this paper. This work was supported by NSFC (no and no ) and NSFXJ (no. 015KL019). REFERENCES [1] M. Aouchiche and P. Hansen. Two Laplacians for the distance matrix of a graph. Linear Algebra and its Applications, 439:1 33, 013. [] J. Bondy and U. Murty. Graph Theory with Applications. Macmillan, London, [3] S.S. Bose, M. Nath, and S. Paul. On the maximal distance spectral radius of graphs without a pendent vertex. Linear Algebra and its Applications, 438: , 013. [4] Y. Chen, H. Lin, and J. Shu. Sharp upper bounds on the distance spectral radius of a graph. Linear Algebra and its Applications, 439: , 013. [5] W. Hong and L. You. Some sharp bounds on the distance signless Laplacian spectral radius of graphs. Mathematics, 013. [6] A. Ilić. Distance spetral radius of trees with given matching number. Discrete Applied Mathematics, 158: , 010. [7] G. Indulal. Sharp bounds on the distance spectral radius and the distance energy of graphs. Linear Algebra and its Applications, 430: , 009. [8] D. Li, G.P. Wang, and J.X. Meng. Some results on the distance and distance signless Laplacian spectral radius of graphs and digraphs. Applied Mathematics and Computation, 93:18 5, 017.
10 Volume 3, pp , December 017. Dan Li, Guoping Wang, and Jixiang Meng 446 [9] H. Lin and X. Lu. Bounds on the distance signless laplacian spectral radius in terms of clique number. Linear Multilinear Algebra, 63(9): , 015. [10] H. Lin, W. Yang, H. Zhang, and J. Shu. The distance spectral radius of digraphs with given connectivity. Discrete Mathematics, 31: , 01. [11] R. Xing, B. Zhou, and J. Li. On the distance signless laplacian spectral radius of graphs. Linear Multilinear Algebra, 6(10): , 014. [1] R. Xing and B. Zhou. On the distance and distance signless Laplacian spectral radii of bicyclic graphs. Linear Algebra and its Applications, 439: , 013.
On 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 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 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 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 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 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 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 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 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 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 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 informationExtremal graph on normalized Laplacian spectral radius and energy
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 16 015
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 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 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 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 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 informationTwo Laplacians for the distance matrix of a graph
Two Laplacians for the distance matrix of a graph Mustapha Aouchiche and Pierre Hansen GERAD and HEC Montreal, Canada CanaDAM 2013, Memorial University, June 1013 Aouchiche & Hansen CanaDAM 2013, Memorial
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 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 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 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 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 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 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 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 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 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 informationELA QUADRATIC FORMS ON GRAPHS WITH APPLICATION TO MINIMIZING THE LEAST EIGENVALUE OF SIGNLESS LAPLACIAN OVER BICYCLIC GRAPHS
QUADRATIC FORMS ON GRAPHS WITH APPLICATION TO MINIMIZING THE LEAST EIGENVALUE OF SIGNLESS LAPLACIAN OVER BICYCLIC GRAPHS GUI-DONG YU, YI-ZHENG FAN, AND YI WANG Abstract. Given a graph and a vector defined
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 informationNullity of Hermitian-Adjacency Matrices of Mixed Graphs
Journal of Mathematical Research with Applications Jan., 2018, Vol. 38, No. 1, pp. 23 33 DOI:10.3770/j.issn:2095-2651.2018.01.002 Http://jmre.dlut.edu.cn Nullity of Hermitian-Adjacency Matrices of Mixed
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 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 informationSpectra of the generalized edge corona of graphs
Discrete Mathematics, Algorithms and Applications Vol 0, No 08) 85000 0 pages) c World Scientific Publishing Company DOI: 04/S7938309850007 Spectra of the generalized edge corona of graphs Yanyan Luo and
More informationThis 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
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 informationKernels of Directed Graph Laplacians. J. S. Caughman and J.J.P. Veerman
Kernels of Directed Graph Laplacians J. S. Caughman and J.J.P. Veerman Department of Mathematics and Statistics Portland State University PO Box 751, Portland, OR 97207. caughman@pdx.edu, veerman@pdx.edu
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 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 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 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 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 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 informationGeneralized left and right Weyl spectra of upper triangular operator matrices
Electronic Journal of Linear Algebra Volume 32 Volume 32 (2017 Article 3 2017 Generalized left and right Weyl spectra of upper triangular operator matrices Guojun ai 3695946@163.com Dragana S. Cvetkovic-Ilic
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 informationarxiv: v1 [cs.ds] 11 Oct 2018
Path matrix and path energy of graphs arxiv:1810.04870v1 [cs.ds] 11 Oct 018 Aleksandar Ilić Facebook Inc, Menlo Park, California, USA e-mail: aleksandari@gmail.com Milan Bašić Faculty of Sciences and Mathematics,
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 informationSpectral directed hypergraph theory via tensors
Linear and Multilinear Algebra ISSN: 0308-1087 (Print) 1563-5139 (Online) Journal homepage: http://www.tandfonline.com/loi/glma20 Spectral directed hypergraph theory via tensors Jinshan Xie & Liqun Qi
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 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 informationZ-Pencils. November 20, Abstract
Z-Pencils J. J. McDonald D. D. Olesky H. Schneider M. J. Tsatsomeros P. van den Driessche November 20, 2006 Abstract The matrix pencil (A, B) = {tb A t C} is considered under the assumptions that A is
More informationarxiv: v1 [math.co] 17 Apr 2018
On extremal cacti with respect to the edge revised Szeged index arxiv:180.06009v1 [math.co] 17 Apr 2018 Shengjie He a, Rong-Xia Hao a, Deming Li b a Department of Mathematics, Beijing Jiaotong University,
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 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 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 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 informationMaximizing the numerical radii of matrices by permuting their entries
Maximizing the numerical radii of matrices by permuting their entries Wai-Shun Cheung and Chi-Kwong Li Dedicated to Professor Pei Yuan Wu. Abstract Let A be an n n complex matrix such that every row and
More informationSpectra of Digraph Transformations
Spectra of Digraph Transformations Aiping Deng a,, Alexander Kelmans b,c a Department of Applied Mathematics, Donghua University, 201620 Shanghai, China arxiv:1707.00401v1 [math.co] 3 Jul 2017 b Department
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 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 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 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 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 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 information5 Flows and cuts in digraphs
5 Flows and cuts in digraphs Recall that a digraph or network is a pair G = (V, E) where V is a set and E is a multiset of ordered pairs of elements of V, which we refer to as arcs. Note that two vertices
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 informationNilpotent matrices and spectrally arbitrary sign patterns
Electronic Journal of Linear Algebra Volume 16 Article 21 2007 Nilpotent matrices and spectrally arbitrary sign patterns Rajesh J. Pereira rjxpereira@yahoo.com Follow this and additional works at: http://repository.uwyo.edu/ela
More informationDeterminant of the distance matrix of a tree with matrix weights
Determinant of the distance matrix of a tree with matrix weights R. B. Bapat Indian Statistical Institute New Delhi, 110016, India fax: 91-11-26856779, e-mail: rbb@isid.ac.in Abstract Let T be a tree with
More informationCLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES
Bull Korean Math Soc 45 (2008), No 1, pp 95 99 CLASSIFICATION OF TREES EACH OF WHOSE ASSOCIATED ACYCLIC MATRICES WITH DISTINCT DIAGONAL ENTRIES HAS DISTINCT EIGENVALUES In-Jae Kim and Bryan L Shader Reprinted
More informationMinimum rank of a graph over an arbitrary field
Electronic Journal of Linear Algebra Volume 16 Article 16 2007 Minimum rank of a graph over an arbitrary field Nathan L. Chenette Sean V. Droms Leslie Hogben hogben@aimath.org Rana Mikkelson Olga Pryporova
More informationIowa State University and American Institute of Mathematics
Matrix and Matrix and Iowa State University and American Institute of Mathematics ICART 2008 May 28, 2008 Inverse Eigenvalue Problem for a Graph () Problem for a Graph of minimum rank Specific matrices
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 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 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 informationPRODUCT DISTANCE MATRIX OF A GRAPH AND SQUARED DISTANCE MATRIX OF A TREE. R. B. Bapat and S. Sivasubramanian
PRODUCT DISTANCE MATRIX OF A GRAPH AND SQUARED DISTANCE MATRIX OF A TREE R B Bapat and S Sivasubramanian Let G be a strongly connected, weighted directed graph We define a product distance η(i, j) for
More informationCharacteristic polynomials of skew-adjacency matrices of oriented graphs
Characteristic polynomials of skew-adjacency matrices of oriented graphs Yaoping Hou Department of Mathematics Hunan Normal University Changsha, Hunan 410081, China yphou@hunnu.edu.cn Tiangang Lei Department
More informationOn the general sum-connectivity index and general Randić index of cacti
Akhter et al. Journal of Inequalities and Applications (2016) 2016:300 DOI 10.1186/s13660-016-1250-6 R E S E A R C H Open Access On the general sum-connectivity index and general Randić index of cacti
More informationInertially arbitrary nonzero patterns of order 4
Electronic Journal of Linear Algebra Volume 1 Article 00 Inertially arbitrary nonzero patterns of order Michael S. Cavers Kevin N. Vander Meulen kvanderm@cs.redeemer.ca Follow this and additional works
More informationThe distance spectral radius of graphs with given number of odd vertices
Electronic Journal of Linear Algebra Volume 31 Volume 31: (016 Article 1 016 The distance spectral radius of graphs with given number of odd vertices Hongying Lin South China Normal University, lhongying0908@16.com
More informationOn a Conjecture of Thomassen
On a Conjecture of Thomassen Michelle Delcourt Department of Mathematics University of Illinois Urbana, Illinois 61801, U.S.A. delcour2@illinois.edu Asaf Ferber Department of Mathematics Yale University,
More informationRON AHARONI, NOGA ALON, AND ELI BERGER
EIGENVALUES OF K 1,k -FREE GRAPHS AND THE CONNECTIVITY OF THEIR INDEPENDENCE COMPLEXES RON AHARONI, NOGA ALON, AND ELI BERGER Abstract. Let G be a graph on n vertices, with maximal degree d, and not containing
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 informationProperties of first eigenvectors and eigenvalues of nonsingular weighted directed graphs
Electronic Journal of Linear Algebra Volume 30 Volume 30 (2015) Article 15 2015 Properties of first eigenvectors and eigenvalues of nonsingular weighted directed graphs Debajit Kalita Tezpur University,
More informationMarkov Chains, Random Walks on Graphs, and the Laplacian
Markov Chains, Random Walks on Graphs, and the Laplacian CMPSCI 791BB: Advanced ML Sridhar Mahadevan Random Walks! There is significant interest in the problem of random walks! Markov chain analysis! Computer
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 informationSingular value inequality and graph energy change
Electronic Journal of Linear Algebra Volume 16 Article 5 007 Singular value inequality and graph energy change Jane Day so@mathsjsuedu Wasin So Follow this and additional works at: http://repositoryuwyoedu/ela
More informationIN1993, Klein and Randić [1] introduced a distance function
IAENG International Journal of Applied Mathematics 4:3 IJAM_4_3_0 Some esults of esistance Distance irchhoff Index Based on -Graph Qun Liu Abstract he resistance distance between any two vertices of a
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 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 41 (2009) 162 178 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: wwwelseviercom/locate/laa On graphs whose signless
More informationSharp Bounds for the Signless Laplacian Spectral Radius in Terms of Clique Number
Sharp Bounds for the Signless Laplacian Spectral Radius in Terms of Clique Number Bian He, Ya-Lei Jin and Xiao-Dong Zhang arxiv:109.314v1 [math.co] 14 Sep 01 Department of Mathematics Shanghai Jiao Tong
More informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
More informationSpectral characterization of Signed Graphs
University of Primorska, Koper May 2015 Signed Graphs Basic notions on Signed Graphs Matrices of Signed Graphs A signed graph Γ is an ordered pair (G, σ), where G = (V (G), E(G)) is a graph and σ : E(G)
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 informationOn the number of cycles in a graph with restricted cycle lengths
On the number of cycles in a graph with restricted cycle lengths Dániel Gerbner, Balázs Keszegh, Cory Palmer, Balázs Patkós arxiv:1610.03476v1 [math.co] 11 Oct 2016 October 12, 2016 Abstract Let L be a
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 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 informationRESEARCH ARTICLE. An extension of the polytope of doubly stochastic matrices
Linear and Multilinear Algebra Vol. 00, No. 00, Month 200x, 1 15 RESEARCH ARTICLE An extension of the polytope of doubly stochastic matrices Richard A. Brualdi a and Geir Dahl b a Department of Mathematics,
More informationMore calculations on determinant evaluations
Electronic Journal of Linear Algebra Volume 16 Article 007 More calculations on determinant evaluations A. R. Moghaddamfar moghadam@kntu.ac.ir S. M. H. Pooya S. Navid Salehy S. Nima Salehy Follow this
More information