The spectrum of the edge corona of two graphs
|
|
- Giles Calvin Nelson
- 5 years ago
- Views:
Transcription
1 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: Recommended Citation Hou, Yaoping and Shiu, Wai-Chee. (1), "The spectrum of the edge corona of two graphs", Electronic Journal of Linear Algebra, Volume. 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, pp , September 1 THE SPECTRUM OF THE EDGE CORONA OF TWO GRAPHS YAOPING HOU AND WAI-CHEE SHIU Abstract. Given two graphs, with vertices 1,,..., n and edges e 1, e,..., e m, and G, the edge corona G of and G is defined as the graph obtained by taking m copies of G and for each edge e k = ij of G, joining edges between the two end-vertices i, j of e k and each vertex of the k-copy of G. In this paper, the adjacency spectrum and Laplacian spectrum of G are given in terms of the spectrum and Laplacian spectrum of and G, respectively. As an application of these results, the number of spanning trees of the edge corona is also considered. Key words. Spectrum, Adjacency matrix, Laplacian matrix, Corona of graphs. AMS subject classifications. 5C5, 5C5. 1. Introduction. Throughout this paper, we consider only simple graphs. Let G = (V,E) be a graph with vertex set V = {1,,...,n}. The adjacency matrix of G denoted by A(G) is defined as A(G) = (a ij ), where a ij = 1 if i and j are adjacent in G, otherwise. The spectrum of G is defined as σ(g) = (λ 1 (G),λ (G),...,λ n (G)), where λ 1 (G) λ (G)... λ n (G) are the eigenvalues of A(G). The Laplacian matrix of G, denoted by L(G) is defined as D(G) A(G), where D(G) is the diagonal degree matrix of G. The Laplacian spectrum of G is defined as S(G) = (θ 1 (G),θ (G),...,θ n (G)), where = θ 1 (G) θ (G)... θ n (G) are the eigenvalues of L(G). We call λ n (G) and θ n (G) the spectral radius and Laplacian spectral radius, respectively. There is extensive literature available on works related to spectrum and Laplacian spectrum of a graph. See [, 5, 6] and the references therein to know more. The corona of two graphs is defined in [4] and there have been some results on the corona of two graphs [3]. The complete information about the spectrum of the corona of two graphs G,H in terms of the spectrum of G,H are given in [1]. In this Received by the editors September 11, 9. Accepted for publication August, 1. Handling Editor: Richard A. Brualdi. Department of Mathematics, Hunan Normal University, Changsha, Hunan 4181, China (yphou@hunnu.edu.cn). Research supported by NSFC(177161). Department of Mathematics, Hong Kong Baptist University, Hong Kong, China. (wcshiu@hkbu.edu.hk). 586
3 Volume, pp , September 1 The Spectrum of the Edge Corona of Two Graphs 587 paper, we consider a variation of the corona of two graphs and discuss its spectrum and the number of spanning trees. Definition 1.1. Let and G be two graphs on disjoint sets of n 1 and n vertices, m 1 and m edges, respectively. The edge corona G of and G is defined as the graph obtained by taking one copy of and m 1 copies of G, and then joining two end-vertices of the i-th edge of to every vertex in the i-th copy of G. Note that the edge corona G of and G has n 1 + m 1 n vertices and m 1 + m 1 n + m 1 m edges. Example 1.. Let be the cycle of order 4 and G be the complete graph K of order. The two edge coronas G and G are depicted in Figure G G G Figure 1: An example of edge corona graphs Throughout this paper, is assumed to be a connected graph with at least one edge. In this paper, we give a complete description of the eigenvalues and the corresponding eigenvectors of the adjacency matrix of G when and G are both regular graphs and give a complete description of the eigenvalues and the corresponding eigenvectors of the Laplacian matrix of G for a regular graph and arbitrary graph G. As an application of these results, we also consider the number of spanning trees of the edge corona.. The spectrum of the graph G. Let the vertex set and edge set of a graph G be V = {1,,...,n} and E = {e 1,e,...,e m }, respectively. The vertex-edge incidence matrix R(G) = (r ij ) is an n m matrix with entry r ij = 1 if the vertex i is incident the edge e j and otherwise. Lemma.1. [, P. 114] Let G be a connected graph with n vertices and R be the vertex-edge incident matrix. Then rank(r) = n 1 if G is bipartite and n otherwise. Lemma.. [] Let G be a connected graph with spectral radius ρ. Then ρ is also an eigenvalue of A(G) if and only if G is bipartite. Moreover, if G is a
4 Volume, pp , September Y. Hou and W. Shiu connected bipartite graph with vertex partition V = V 1 V and X = (X 1,X ) T is an eigenvector corresponding eigenvalue λ of A(G) then X = (X 1, X ) T is an eigenvector corresponding eigenvalue λ of A(G). Let A = (a ij ),B be matrices. Then the Kronecker product of A and B is defined the partition matrix (a ij B) and is denoted by A B. The row vector of size n with all entries equal to one is denoted by j n and the identity matrix of order n is denoted by I n. Let and G be graphs with n 1,n vertices and m 1,m edges,respectively. Then the adjacency matrix of G = G can be written as A(G) = A( ) R( ) j n (R( ) j n ) T I m1 A(G ) where A( ) and A(G ) are the adjacency matrices of the graphs and G, respectively, and R( ) is the vertex-edge incidence matrix of. A complete characterization of the eigenvalues and eigenvectors of G will be given when both and G are regular., Let be an r 1 -regular graph and G be an r -regular graph and (.1) σ( ) = (µ 1,µ,...,µ n1 ), σ(g ) = (η 1,η,...,η n ) be their adjacency spectrum, respectively. If is 1-regular then = K as is connected. In this case, G is the complete product of K and G. By Theorem.8 of [], or by some direct computations, we can obtain the spectrum of G = G as (η 1,...,η n 1,µ 1 = r+µ1 (r µ 1) +4(r 1+µ 1)n, r+µ± (r µ ) +4(r 1+µ )n ), where µ 1 = 1,µ = 1 are the spectrum of K. Theorem.3. Let be an r 1 -regular (r 1 ) graph and G be an r -regular graph and their spectra are as in (.1). Then the spectrum σ(g) of G is ( η 1 η η n = r r +µ 1± (r µ 1) +4(r 1+µ 1)n m 1 m 1 m 1 n 1 1 r +µ n1 ± (r µ n1 ) +4(r 1+µ n1 )n 1 ) where entries in the first row are the eigenvalues with the number of repetitions written below, respectively.
5 Volume, pp , September 1 The Spectrum of the Edge Corona of Two Graphs 589 G Z j e i G X i s t u v G X i (s)+x i (t) λ i r j G X i (u)+x i (v) λ i r j s t u v Y stj G G Y uvj G Figure : Description of adjacency eigenvectors Proof. Let Z 1,Z,...,Z n be the orthogonal eigenvectors of A(G ) corresponding to the eigenvalue η 1,η,..., η n = r, respectively. Note that G is r -regular and Z j j for j = 1,,...,n 1. Then for i = 1,,...,m 1 and for j = 1,,...,n 1, we have (see Figure, picture on the left) that (n 1 + m 1 n )-dimension vectors (,,...,,Z j,,...,) T, where (i+1)-th block is Z j are eigenvectors of G corresponding to eigenvalue η j. Thus we obtain m 1 (n 1) eigenvalues and corresponding eigenvectors of G. Let X 1,X,...,X n1 be the orthogonal eigenvectors of A( ) corresponding to the eigenvalues µ 1,µ,...µ n1, respectively. For i = 1,,...,n 1, let and λ i = r + µ ni + (r µ ni ) + 4(r 1 + µ ni )n λ i = r + µ ni (r µ ni ) + 4(r 1 + µ n )n. Note that r+µn i ± (r µ ni ) +4(r 1+µ ni )n = r if and only if µ i = r 1. So λ i or λ i is r if and only if is bipartite (note that at most one of λ i is r ). If is bipartite and the bipartition of its vertex set is V 1 V, then by Lemma. and some computations, we obtain that (j, j,,...,) T (1 on V 1, 1 on V, and on all copies of G ) is an eigenvector of G corresponding the eigenvalue r 1. Observe that if λ i and λ i are not equal to r then λ i and λ i are eigenvalues of G corresponding to the eigenvectors F i = (X i,..., Xi(s)+Xi(t) λ i r,...) T and F i = (X i,..., Xi(s)+Xi(t),...) T, respectively (see Figure, picture in the middle). In fact, it λ i r needs only to be checked that characteristic equations v u F i(v) = λ i F i (u) (resp. F v u i (v) = λ i Fi (u)) hold for every vertex u in G. For any vertex u in k-copy of G, let edge e k = st, then F i (u) = Xi(s)+Xi(t) λ i r. Furthermore, F i (v) = r F i (u) + X i (s) + X i (t) = λ i F i (u). v u
6 Volume, pp , September 1 59 Y. Hou and W. Shiu For any vertex u in, F i (v) = v u v u,v V () F i (v) + v u,v V () = µ i X i (u) + r 1n X i (u) λ i r + n λ i r = λ i X i (u) = λ i F i (u). F i (v) v u,v V () F i (v) Therefore we obtain n 1 eigenvalues and corresponding eigenvectors of G if is not bipartite and n 1 1 eigenvalues and corresponding eigenvectors of G if is bipartite. Let Y 1,Y,...,Y b be a maximal set of independent solution vectors of linear system R( )Y =. Then b = m 1 n 1 if is not bipartite and b = m 1 n if is bipartite. For i = 1,,...,b, let H i = (,Y i (e 1 )j,...,y i (e m )j) T (see Figure, picture on the right). We can obtain that H i is an eigenvector of G corresponding to eigenvalues r = η n. Thus these Y i s provide b eigenvalues and corresponding eigenvectors of G. Therefore we obtain n 1 + m 1 n eigenvalues and corresponding eigenvectors of G and it is easy to see that these eigenvectors of G are linearly independent. Hence the proof is completed. Next we consider the Laplacian spectrum of G. Let L( ) and L(G ) be the Laplacian matrices of the graphs and G, respectively, and R( ) be the vertex-edge incidence matrix of. Then the Laplacian matrix of G = G is L(G) = L( ) + r 1 n I n1 R( ) j n (R( ) j n ) T I m1 (I n + L(G )). In the following, we give a complete characterization of the Laplacian eigenvalues and eigenvectors of G. Let be an r 1 -regular graph and G be any graph and (.) S( ) = (θ 1,θ,...,θ n1 ), S(G ) = (τ 1,τ,...,τ n ) be their Laplacian spectra, respectively. If is 1-regular then = K as is connected. In this case, G is the complete product of K and G (by [5]), or by some direct computations, we can obtain that the Laplacian spectrum of G = G
7 Volume, pp , September 1 The Spectrum of the Edge Corona of Two Graphs 591 is S(G) = (,τ +,...,τ n +,n +,n + ). Theorem.4. Let be an r 1 -regular (r 1 ) graph and G be any graph and their Laplacian spectra are written as in (.). Let β i, β i = r 1n + θ i + ± (r 1 n + θ i + ) 4(n + )θ i for every θ i. Then the Laplacian spectrum S(G) of G is ( τ1 +, τ +,, τ n +, β 1, β1,, β n1, βn1 m 1 n 1 m 1 m ) where entries in the first row are the eigenvalues with the number of repetitions written below, respectively. G Z j e i G X i s t u v G X i (s)+x i (t) β i j X G i (u)+x i (v) β i j s t u v G G Y st j Y uv j G Figure 3: Description of Laplacian eigenvectors Proof. Let Z 1,Z,...,Z n be the eigenvectors of L(G ) corresponding to the eigenvalues = τ 1,τ,...,τ n. Note that Z j j for j =,...,n. Then for i = 1,,...,m 1 and for j =,3,...,n, we have that (n 1 +m 1 n )-dimension vectors (,,...,,Z j,,...,) T, where (i+1)-th block is Z j are eigenvectors of L(G) corresponding to eigenvalue τ j + (see Figure 3, picture on the left). Thus we obtain m 1 (n 1) eigenvalues and corresponding eigenvectors of L(G). Let X 1,X,...,X n1 be the orthogonal eigenvectors of L( ) corresponding to the eigenvalues θ 1,θ,...,θ n1, respectively. For i = 1,,...,n 1, note that: β i, β i = r1n+θi+± (r 1n +θ i+) 4(n +)θ i = r1n+θi+± (r 1n +θ i ) +4n (r 1 θ i) since r 1,n 1, β i. Note that θ i r 1 and the equality holds if and only if is bipartite. Note that β i = implies that θ i = r 1. That is, βi = appears only if is bipartite and i = n 1. Moreover, if is bipartite and the bipartition of its vertex set is V 1 V, then it is easy to check that (j, j,,...,) T (1 on V 1,
8 Volume, pp , September 1 59 Y. Hou and W. Shiu 1 on V, and on all copies of G ) is an eigenvector corresponding the eigenvalue (n 1 + )r 1 = β n1 of L(G). Observe that if β i and β i are not equal to, then β i and β i are eigenvalues of L(G) and F i = (X i,..., Xi(s)+Xi(t) β i,...) T and F i = (X i,..., Xi(s)+Xi(t),...) T are eigenvectors β i of β i and β i respectively (see Figure 3, picture in the middle). In fact, it needs only to be checked that characteristic equations d G (u)f i (u) v u F i(v) = β i F i (u) (resp. d G (u) F i (u) F v u i (v) = β i Fi (u)) hold for every vertex u in G, where d G (u) is the degree of the vertex u in G. For every vertex u in k-copy of G, let the edge e k = st, then d G (u) = d G (u)+ and F i (u) = Xi(s)+Xi(t) β i. Further, d G (u)f i (u) v u F i (v) = d G (u) + )F i (u) d G (u) X i(s) + X i (t) β i (X i (s) + X i (t)) = β i F i (u). For every vertex u in, note that r 1 X i (u) v u X i (v) = θ i X i (u). v V ( ) We have d G (u)f i (u) v u F i (v) = (r 1 + r 1 n )F i (u) = (r 1 + r 1 n )X i (u) v u,v V () X i (v) v u,v V () v u,v V () = (r 1 + r 1 n )( β i ) n r 1 + n θ i β i X i (u) + (θ i r 1 )X i (u) = β i X i (u) = β i F i (u). F i (v) + v u,v V () n β i (X i (u) + X i (v)) F i (v) Therefore we obtain n 1 eigenvalues and corresponding eigenvectors of L(G) if is not bipartite, and n 1 1 eigenvalues and corresponding eigenvectors of L(G) if is bipartite. Let Y 1,Y,...,Y b be a maximal set of independent solution vectors of the linear system R( )Y =. Then b = m 1 n 1 if is not bipartite, and b = m 1 n if is bipartite. For i = 1,,...,b, let H i = (,Y i (e 1 )j,...,y i (e m )j) T (see Figure 3, picture on the right). We can obtain that H i is an eigenvector corresponding the eigenvalue (= τ 1 + ) of L(G). Thus these Y i s provide b eigenvalues and corresponding eigenvectors of L(G).
9 Volume, pp , September 1 The Spectrum of the Edge Corona of Two Graphs 593 Therefore we obtain n 1 + m 1 n eigenvalues and corresponding eigenvectors of L(G) and it is easy to see that these eigenvectors of L(G) are linearly independent. Hence the proof is completed. As an application of the above results, we give the number of spanning trees of the edge corona of two graphs. Let G be a connected graph with n vertices and Laplacian eigenvalues = θ 1 < θ θ n. Then the number of spanning trees of G is By Theorem.4 we have t(g) = θ θ 3 θ n. n Proposition.5. For a connected r 1 -regular graph and arbitrary graph G, let the number of spanning trees of be t( ) and the Laplacian spectra of G be = τ 1 τ τ n. Then the number of spanning trees of G is t( G ) = m1 n1+1 (n + ) n1 1 t( )(τ + ) m1 (τ n + ) m1. Proof. Following the notions in Theorem.4, note that β i βi = (n + )θ i for i = 1,,...,n 1 and β 1 = r 1 n +, β 1 =. Thus t( G ) = m1 n1 (r 1 n + )(n + ) n1 1 n i= (τ i + ) m1 n 1 j= θ j n 1 + m 1 n = n 1 m1 n1 (r 1 n + )(n + ) n1 1 t( ) n i= (τ i + ) m1 n 1 + m 1 n = m1 n1+1 (n + ) n1 1 t( )(τ + ) m1 (τ n + ) m1. The last equality follows from n 1 + m 1 n = n1(+r1n). By Proposition.5, we have t(g K 1 ) = m n+1 3 n 1 t(g) for a regular graph G. In fact t(g K 1 ) = m n+1 3 n 1 t(g) holds for arbitrary graph G by the following proposition. Proposition.6. Let G be a connected graph with n vertices and m edges. Then the number of spanning trees of G K 1 is m n+1 3 n 1 t(g), where t(g) is the number of spanning trees of G. Proof. Note that the Laplacian matrix of G K 1 is ( L(G) + D(G) R L(G K 1 ) = R T I m ).
10 Volume, pp , September Y. Hou and W. Shiu Let (L(G)) 11 be the reduced Laplacian matrix of G obtained by removing the first row and first column of L(G) and R 1 be the matrix obtained by removing the first row of the vertex-edge incidence matrix R. By the Matrix-Tree theorem [], we have ( ) (L(G) + D(G))11 R t(g K 1 ) = det(l(g K 1 )) 11 = det 1 R1 T I m = m det[(l(g) + D(G)) 11 1 R 1R T 1 ], since RR T = D(G) + A(G), R 1 R T 1 = (D(G) + A(G)) 11. Thus t(g K 1 ) = m det( 3 (D(G) A(G)) 11 = m n+1 3 n 1 t(g). Acknowledgments. The authors would like to express their sincere gratitude to the referee for a very careful reading of the paper and for all his or her insightful comments and valuable suggestions, which made a number of improvements on this paper REFERENCES [1] S. Barik, S. Pati, and B. K. Sarma. The spectrum of the corona of two graphs. SIAM. J. Discrete Math., 4:47 56, 7. [] D. Cvetković, M. Doob, and H. Sachs. Spectra of Graphs: Theory and Application, Johann Ambrosius Barth Verlag, Heidelberg-Leipzig, [3] R. Frucht and F. Harary. On the corona two graphs. Aequationes Math., 4:3 35, 197. [4] F. Harary. Graph Theory. Addition-Wesley Publishing Co., Reading, MA/Menlo Park, CA/London, [5] R. Merris. Laplacian matrices of graphs: a survey. Linear Algebra Appl., 197/198: , [6] B. Mohar. The Laplacian spectrum of graphs, Graph Theory, Combinatorics and Applications. John Wiley, New York, pp , 1991.
Spectra 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 informationarxiv: v2 [math.co] 27 Jul 2013
Spectra of the subdivision-vertex and subdivision-edge coronae Pengli Lu and Yufang Miao School of Computer and Communication Lanzhou University of Technology Lanzhou, 730050, Gansu, P.R. China lupengli88@163.com,
More 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 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 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 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 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 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 informationSome spectral inequalities for triangle-free regular graphs
Filomat 7:8 (13), 1561 1567 DOI 198/FIL138561K Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://wwwpmfniacrs/filomat Some spectral inequalities for triangle-free
More 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 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 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 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 informationELA
UNICYCLIC GRAPHS WITH THE STRONG RECIPROCAL EIGENVALUE PROPERTY S. BARIK, M. NATH, S. PATI, AND B. K. SARMA Abstract. AgraphG is bipartite if and only if the negative of each eigenvalue of G is also an
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 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 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 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 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 informationApplicable Analysis and Discrete Mathematics available online at GRAPHS WITH TWO MAIN AND TWO PLAIN EIGENVALUES
Applicable Analysis and Discrete Mathematics available online at http://pefmath.etf.rs Appl. Anal. Discrete Math. 11 (2017), 244 257. https://doi.org/10.2298/aadm1702244h GRAPHS WITH TWO MAIN AND TWO PLAIN
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 informationAn Introduction to Spectral Graph Theory
An Introduction to Spectral Graph Theory Mackenzie Wheeler Supervisor: Dr. Gary MacGillivray University of Victoria WheelerM@uvic.ca Outline Outline 1. How many walks are there from vertices v i to v j
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 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 informationSpectra of Weighted Directed Graphs. Debajit Kalita. Doctor of Philosophy
Spectra of Weighted Directed Graphs A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy by Debajit Kalita to the Department of Mathematics Indian Institute
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 informationGraphs with given diameter maximizing the spectral radius van Dam, Edwin
Tilburg University Graphs with given diameter maximizing the spectral radius van Dam, Edwin Published in: Linear Algebra and its Applications Publication date: 2007 Link to publication Citation for published
More 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 informationEnergy, Laplacian Energy and Zagreb Index of Line Graph, Middle Graph and Total Graph
Int. J. Contemp. Math. Sciences, Vol. 5, 21, no. 18, 895-9 Energy, Laplacian Energy and Zagreb Index of Line Graph, Middle Graph and Total Graph Zhongzhu Liu Department of Mathematics, South China Normal
More 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 informationThe spectra of super line multigraphs
The spectra of super line multigraphs Jay Bagga Department of Computer Science Ball State University Muncie, IN jbagga@bsuedu Robert B Ellis Department of Applied Mathematics Illinois Institute of Technology
More informationOn graphs with largest Laplacian eigenvalue at most 4
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 44 (2009), Pages 163 170 On graphs with largest Laplacian eigenvalue at most 4 G. R. Omidi Department of Mathematical Sciences Isfahan University of Technology
More informationLinear Algebra and its Applications
Linear Algebra and its Applications 430 (2009) 532 543 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: wwwelseviercom/locate/laa Computing tight upper bounds
More 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 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 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 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 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 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 informationA lower bound for the spectral radius of graphs with fixed diameter
A lower bound for the spectral radius of graphs with fixed diameter Sebastian M. Cioabă Department of Mathematical Sciences, University of Delaware, Newark, DE 19716, USA e-mail: cioaba@math.udel.edu Edwin
More 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 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 informationLinear Algebra and its Applications
Linear Algebra and its Applications 432 2010 661 669 Contents lists available at ScienceDirect Linear Algebra and its Applications journal homepage: wwwelseviercom/locate/laa On the characteristic and
More information38 PETROVIĆ AND MILEKIĆ In this paper we also determine all minimal generalized line graphs with the property 2 (G) > 1. There are exactly 21 such gra
PUBLICATIONS DE L'INSTITUT MATHÉMATIQUE Nouvelle série, tome 68(82) (2000), 37 45 GENERALIZED LINE GRAPHS WITH THE SECOND LARGEST EIGENVALUE AT MOST 1 Miroslav Petrović and Bojana Milekić Communicated
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 informationOn nonnegative realization of partitioned spectra
Electronic Journal of Linear Algebra Volume Volume (0) Article 5 0 On nonnegative realization of partitioned spectra Ricardo L. Soto Oscar Rojo Cristina B. Manzaneda Follow this and additional works at:
More informationOn the maximum positive semi-definite nullity and the cycle matroid of graphs
Electronic Journal of Linear Algebra Volume 18 Volume 18 (2009) Article 16 2009 On the maximum positive semi-definite nullity and the cycle matroid of graphs Hein van der Holst h.v.d.holst@tue.nl Follow
More informationThe Adjacency Matrix, Standard Laplacian, and Normalized Laplacian, and Some Eigenvalue Interlacing Results
The Adjacency Matrix, Standard Laplacian, and Normalized Laplacian, and Some Eigenvalue Interlacing Results Frank J. Hall Department of Mathematics and Statistics Georgia State University Atlanta, GA 30303
More 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 informationLAPLACIAN ENERGY FOR A BALANCED GRAPH
LAPLACIAN ENERGY FOR A BALANCED GRAPH Dr. K. Ameenal Bibi 1, B. Vijayalakshmi 2 1,2 Department of Mathematics, 1,2 D.K.M College for Women (Autonomous), Vellore 632 001, India Abstract In this paper, we
More informationNon-trivial solutions to certain matrix equations
Electronic Journal of Linear Algebra Volume 9 Volume 9 (00) Article 4 00 Non-trivial solutions to certain matrix equations Aihua Li ali@loyno.edu Duane Randall Follow this and additional works at: http://repository.uwyo.edu/ela
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 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 informationELA A NOTE ON GRAPHS WHOSE LARGEST EIGENVALUE OF THE MODULARITY MATRIX EQUALS ZERO
A NOTE ON GRAPHS WHOSE LARGEST EIGENVALUE OF THE MODULARITY MATRIX EQUALS ZERO SNJEŽANA MAJSTOROVIĆ AND DRAGAN STEVANOVIĆ Abstract. Informally, a community within a graph is a subgraph whose vertices are
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 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 informationThe symmetric minimal rank solution of the matrix equation AX=B and the optimal approximation
Electronic Journal of Linear Algebra Volume 18 Volume 18 (2009 Article 23 2009 The symmetric minimal rank solution of the matrix equation AX=B and the optimal approximation Qing-feng Xiao qfxiao@hnu.cn
More informationRETRACTED On construction of a complex finite Jacobi matrix from two spectra
Electronic Journal of Linear Algebra Volume 26 Volume 26 (203) Article 8 203 On construction of a complex finite Jacobi matrix from two spectra Gusein Sh. Guseinov guseinov@ati.edu.tr Follow this and additional
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 number of spanning trees of K m n ± G graphs
Discrete Mathematics and Theoretical Computer Science DMTCS vol 8, 006, 35 48 On the number of spanning trees of K m n ± G graphs Stavros D Nikolopoulos and Charis Papadopoulos Department of Computer Science,
More informationChapter 2 Spectra of Finite Graphs
Chapter 2 Spectra of Finite Graphs 2.1 Characteristic Polynomials Let G = (V, E) be a finite graph on n = V vertices. Numbering the vertices, we write down its adjacency matrix in an explicit form of n
More 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 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 informationDRAGAN STEVANOVIĆ. Key words. Modularity matrix; Community structure; Largest eigenvalue; Complete multipartite
A NOTE ON GRAPHS WHOSE LARGEST EIGENVALUE OF THE MODULARITY MATRIX EQUALS ZERO SNJEŽANA MAJSTOROVIĆ AND DRAGAN STEVANOVIĆ Abstract. Informally, a community within a graph is a subgraph whose vertices are
More informationOn the reduction of matrix polynomials to Hessenberg form
Electronic Journal of Linear Algebra Volume 3 Volume 3: (26) Article 24 26 On the reduction of matrix polynomials to Hessenberg form Thomas R. Cameron Washington State University, tcameron@math.wsu.edu
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 informationThe Distance Spectrum
The Distance Spectrum of a Tree Russell Merris DEPARTMENT OF MATHEMATICS AND COMPUTER SClENCE CALlFORNlA STATE UNlVERSlN HAYWARD, CAL lfornla ABSTRACT Let T be a tree with line graph T*. Define K = 21
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 informationSpectral results on regular graphs with (k, τ)-regular sets
Discrete Mathematics 307 (007) 1306 1316 www.elsevier.com/locate/disc Spectral results on regular graphs with (k, τ)-regular sets Domingos M. Cardoso, Paula Rama Dep. de Matemática, Univ. Aveiro, 3810-193
More informationLaplacians of Graphs, Spectra and Laplacian polynomials
Laplacians of Graphs, Spectra and Laplacian polynomials Lector: Alexander Mednykh Sobolev Institute of Mathematics Novosibirsk State University Winter School in Harmonic Functions on Graphs and Combinatorial
More 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 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 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 informationThe Hierarchical Product of Graphs
The Hierarchical Product of Graphs Lali Barrière Francesc Comellas Cristina Dalfó Miquel Àngel Fiol Universitat Politècnica de Catalunya - DMA4 April 8, 2008 Outline 1 Introduction 2 Graphs and matrices
More 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 information18.312: Algebraic Combinatorics Lionel Levine. Lecture 19
832: Algebraic Combinatorics Lionel Levine Lecture date: April 2, 20 Lecture 9 Notes by: David Witmer Matrix-Tree Theorem Undirected Graphs Let G = (V, E) be a connected, undirected graph with n vertices,
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 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 informationA new upper bound for the eigenvalues of the continuous algebraic Riccati equation
Electronic Journal of Linear Algebra Volume 0 Volume 0 (00) Article 3 00 A new upper bound for the eigenvalues of the continuous algebraic Riccati equation Jianzhou Liu liujz@xtu.edu.cn Juan Zhang Yu Liu
More informationThe Matrix-Tree Theorem
The Matrix-Tree Theorem Christopher Eur March 22, 2015 Abstract: We give a brief introduction to graph theory in light of linear algebra. Our results culminates in the proof of Matrix-Tree Theorem. 1 Preliminaries
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 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 informationAn angle metric through the notion of Grassmann representative
Electronic Journal of Linear Algebra Volume 18 Volume 18 (009 Article 10 009 An angle metric through the notion of Grassmann representative Grigoris I. Kalogeropoulos gkaloger@math.uoa.gr Athanasios D.
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 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 informationSpectral Characterization of Generalized Cocktail-Party Graphs
Journal of Mathematical Research with Applications Nov., 01, Vol. 3, No. 6, pp. 666 67 DOI:10.3770/j.issn:095-651.01.06.005 Http://jmre.dlut.edu.cn Spectral Characterization of Generalized Cocktail-Party
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 informationThe Hierarchical Product of Graphs
The Hierarchical Product of Graphs Lali Barrière Francesc Comellas Cristina Dalfó Miquel Àngel Fiol Universitat Politècnica de Catalunya - DMA4 March 22, 2007 Outline 1 Introduction 2 The hierarchical
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 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 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 informationSPECTRA OF GRAPH OPERATIONS BASED ON CORONA AND NEIGHBORHOOD CORONA OF GRAPH G AND K 1
JOURNAL OF THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4866, ISSN (o) 2303-4947 www.imvibl.org / JOURNALS / JOURNAL Vol. 5(2015), 55-69 Former BULLETIN OF THE SOCIETY OF MATHEMATICIANS
More informationUnicyclic graphs with exactly two main eigenvalues
Applied Mathematics Letters 19 (006) 1143 1147 www.elsevier.com/locate/aml Unicyclic graphs with exactly two main eigenvalues Yaoping Hou a,,fengtian b a Department of Mathematics, Hunan Normal University
More informationEdge-Disjoint Spanning Trees and Eigenvalues of Regular Graphs
Edge-Disjoint Spanning Trees and Eigenvalues of Regular Graphs Sebastian M. Cioabă and Wiseley Wong MSC: 05C50, 15A18, 05C4, 15A4 March 1, 01 Abstract Partially answering a question of Paul Seymour, we
More informationLAPLACIAN ENERGY OF UNION AND CARTESIAN PRODUCT AND LAPLACIAN EQUIENERGETIC GRAPHS
Kragujevac Journal of Mathematics Volume 39() (015), Pages 193 05. LAPLACIAN ENERGY OF UNION AND CARTESIAN PRODUCT AND LAPLACIAN EQUIENERGETIC GRAPHS HARISHCHANDRA S. RAMANE 1, GOURAMMA A. GUDODAGI 1,
More 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 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 information