Vertex Degrees and Doubly Stochastic Graph Matrices
|
|
- Clara Andrews
- 5 years ago
- Views:
Transcription
1 Vertex Degrees and Doubly Stochastic Graph Matrices Xiao-Dong Zhang DEPARTMENT OF MATHEMATICS, SHANGHAI JIAO TONG UNIVERSITY 800 DONGCHUAN ROAD, SHANGHAI, , P. R. CHINA Received May 2, 2006; Revised December 2, 2009 Published online 2 November 200 in Wiley Online Library (wileyonlinelibrary.com). DOI 0.002/jgt Abstract: In this article, the relationship between vertex degrees and entries of the doubly stochastic graph matrix has been investigated. In particular, we present an upper bound for the main diagonal entries of a doubly stochastic graph matrix and investigate the relations between a kind of distance for graph vertices and the vertex degrees. These results are used to answer in negative Merris question on doubly stochastic graph matrices. These results may also be used to establish relations between graph structure and entries of doubly stochastic graph matrices. 200 Wiley Periodicals, Inc. J Graph Theory 66: 04 4, 20 Contract grant sponsor: National Natural Science Foundation of China; Contract grant numbers: 09737; ; Contract grant sponsor: National Basic Research Program (973) of China; Contract grant number: 2006CB805900; Contract grant sponsor: National High Technology Research and Development Program (863) of China; Contract grant number: 2006AAZ209; Contract grant sponsor: Science and Technology Commission of Shanghai Municipality; Contract grant number: 09XD Journal of Graph Theory 200 Wiley Periodicals, Inc. 04
2 VERTEX DEGREES 05 MSC 2000: 05 C 50; 05 C 05; 05 C 2 Keywords: tree; doubly stochastic matrix; distance. INTRODUCTION Let G=(V,E) be a simple graph with vertex set V(G)={v,...,v n } and edge set E(G). Denote by d(v i )ord i the degree of vertex v i. Let D(G)=diag(d,...,d n )bethedegree diagonal matrix and A(G) bethen n adjacency matrix whose (i, j)-entry is if (v i,v j ) E and 0 otherwise. The matrix L(G)=D(G) A(G) is called the Laplacian matrix of G, which may be dated back to Kirchhoff s Matrix-Tree Theorem and has been extensively studied for the past fifty years (e.g. see [, 4] and the references therein). Let I n be the n n identity matrix. It follows from [7] (also see [2]) that Ω(G)=(I n +L(G)) =(ω ij ) is a doubly stochastic matrix. So Ω(G) iscalledthedoubly stochastic graph matrix, which was introduced by Golender et al. [7] (see also [4]) in their study of chemical information processing. Chebotarev and Shamis in [4] pointed out that the doubly stochastic graph matrix may be regarded as the matrix of relative forest accessibility of the vertices of G by the matrix-forest theorem. Therefore these values can be used to measure the proximity among vertices and may be used to evaluate the group cohesion in the construction of sociometric indices. Chebotarev and Shamis [3] and Merris [2] independently proved the important result on the relationship between the entry of the doubly stochastic matrix of a graph and its number of spanning forests. Theorem. (Chebotarev and Shamis [3], Merris [2]). Let G be a simple graph with vertex set V(G)={v,...,v n }.LetF be the set of all spanning forests of G and F(i,j) be the set of all spanning forests of G with both vertices v i and v j belonging to the same component. For F F, define γ(f) to be the product of the numbers of vertices in the connected components of F and γ i (F) to be the product of the numbers of vertices in the connected components of F that do not contain vertex v i.then F F(i,j) ω ij = γ i(f) F F γ(f). It is noted that the formulation in Theorem. had been mentioned in [2] and had been also proved in [5]. Moreover, Merris in [3] established the relationship between the entry ω ij of Ω(G) and structure of G. Theorem.2 (Merris [3]). Let G be a simple graph on n vertices. If ω ij <4/ (n 2 +4n), then v i is not adjacent to v j. Moreover, ω ij is also relative to the weights of routes of various lengths between v i and v j (see [4], Proposition 0). Recently, Zhang in [8] presented some relations between the diameter of a tree and the smallest entry ω(g)=min{ω ij, i,j n}. Roughly speaking, the smaller the ω(g) is, the larger the diameter. Since the algebraic connectivity α(g) of G, i.e. the second smallest eigenvalue of L(G), is related to many graph invariants (see [, 4]), the entries of Ω(G) and related parameters may be further
3 06 JOURNAL OF GRAPH THEORY considered with the aid of the second largest eigenvalue of Ω(G) being /(+α(g)). For more related results, the reader may be referred to [, 5, 6, 0, 6, 7]. Chebotarev et al. in [4] introduced the following notation. Definition.3. Let G=(V,E) be a simple graph on vertex set V ={v,...,v n } with doubly stochastic graph matrix Ω(G)=(ω ij ). Define ρ(v i,v j )=ω ii +ω jj 2ω ij. Chebotarev et al. showed that ρ is a distance and adding an edge to G cannot increase the distance between any pair of its vertices. By Theorem., ρ(v i,v j ) takes into account all connecting paths between vertices v i and v j. Merris in [3] introduced the following notation. Definition.4. Let G be a simple graph on vertex set V ={v,...,v n } with doubly stochastic graph matrix Ω(G)=(ω ij ). Let r(i)= n ρ(v i,v j ) and define j= r(g)=min{r(i), i n}, r(g)=max{r(i), i n}. If r(k)=r(g), then v k is called a most remote vertex; andifr(k)=r(g), then v k is called a least remote vertex. Merris in [3] proved that v k is a most remote vertex if and only if ω kk is a main diagonal maximum entry, and v i is a least remote vertex if and only if ω ii is a main diagonal minimum entry. The usual distance σ(v i,v j ) is the number of edges in the shortest path from v i to v j.themean distance (see [9]) in a connected graph G on n vertices is given by μ(g)=(/n(n )) v i,v j V σ(v i,v j ), which is related to the Wiener index (see []). From [0], it is easy to see that if T is a tree, then μ(t)= 2 n n i=2 λ i λ i, where =λ λ 2 λ n are all eigenvalues of Ω(G). On the other hand, the quantity W ρ (G)= v n(n ) i,v j ρ(v i,v j )= ni= r(i) n(n ) satisfies W ρ (G)= n λ i. n Furthermore, Merris [3] proposed the following question. Question.5. Let G be a simple graph on vertex set V ={v,...,v n } with doubly stochastic graph matrix Ω(G)=(ω ij ).Doesd k >d i for all i k imply r(k)=r(g)? i=2
4 VERTEX DEGREES 07 The following main result of this article consists of two parts. We first answer Question.5 in negative and then prove a sufficient condition under which Question.5 is indeed true. Theorem.6. (i) There exists a family of graphs with d k >d i for all i k butr(k)>r(g). (ii) Let G be a simple graph. If d k 2d i for all i k, then r(k)=r(g). The rest of this article is organized as follows: In Section 2, we present an upper bound for the main diagonal entries of doubly stochastic graph matrices and characterize all extremal graphs which attain the upper bound. In Section 3, we investigate the relations between distances for graph vertices and vertex degrees and present a proof of Theorem AN UPPER BOUND FOR THE MAIN DIAGONAL ENTRIES OF X(G) We need more notation. Let G be a simple graph on n vertices with doubly stochastic graph matrix Ω(G)=(ω ij ), define ω(g)=max{ω ii, i n}. A vertex of G is called dominating if it is adjacent to every other vertex in G. The main result of this section is the following. Theorem 2.. Let G be a simple connected graph on n vertices with doubly stochastic graph matrix Ω(G)=(ω ij ).Then ω(g) 2n + 2n 2n 2n with equality if and only if G is a path on n vertices, where =( 5+)/2. We first prove some preliminary results. Lemma 2.2. Let G be a simple graph on n vertices {v,...,v n } with Ω(G)=(ω ij ). Then d i + ω ii 2 d i +2. Moreover, if G is connected, then for i n the right hand equality holds if and only if v i is a dominating vertex and the left hand equality holds if and only if n=. Proof. Let L(G)=(l ij ). By equating the (i,i)-entry on both sides of the equation (I n +L(G))Ω(G)=I n, we see that (l ii +)ω ii + n j=,j i l ij ω ij =. Since n j= ω ij =, we have (d i +2)ω ii =2 ω ij, () v j v i
5 08 JOURNAL OF GRAPH THEORY where v j v i means that v j is not adjacent to v i and v j v i. Hence ω ii 2 v j v i ω ij d i +2 2 d i +2. If G is connected, then ω ij >0 for i,j n. Hence the above equality holds if and only if v j v i ω ij =0, i.e. if and only if v i is a dominating vertex. Similarly, we have (d i +)ω ii =+ v j v i ω ij, (2) where v j v i means that v j is adjacent to v i. Hence with equality if and only if n=. ω ii d i + Lemma 2.3. Let P n be a path on n vertices with doubly stochastic matrix Ω(P n )=(ω ij ).Letω(P n )=max{ω ii, i n}. Then where =( 5+)/2. ω(p n )= 2n + 2n 2n 2n, Proof. Let P n be the path with vertices v,...,v n in order. Then d =d n =and d 2 = =d n =2. By Lemma 2.2, ω ii 2 for i=2,...,n. By symmetry, ω =ω nn. We next show that ω(p n )=ω by showing that ω > 2. By equating the entries in the first column of the equation (I n +L(P n ))Ω(P n )=I n, we obtain n equations 2ω ω 2 =, ω +3ω 2 ω 3 =0,..., ω n 2, +3ω n, ω n =0, ω n, +2ω n =0. One can easily check that ω = 2 3 when n=2, and ω = 5 8 when n=3. For n 4, by eliminating ω n,...,ω 2 recursively from the last n equations, we see that (2+ ( 3+ ) n 2 5 5) (2 3 5)( ) n ω = ( 3+ ) n 5 3 ( ) n = 2n + 2n 5 2n 2n > Hence ω(p n )=ω, as desired. We are now ready to prove Theorem 2.. Proof of Theorem 2.. We prove the assertion by induction on n. Ifn= or2, the assertion clearly holds. Assume that the assertion holds for n. By Theorem in [3], we observe that deleting an edge from G cannot decrease the main diagonal entries of doubly stochastic graph matrix Ω(G). Hence without loss of generality, we only consider that G isatreeonn vertices.
6 VERTEX DEGREES 09 If d i 2, then by Lemmas 2.2 and 2.3, ω ii (2/(d i +2)) 2 <ω(p n). If d i =, without loss of generality, we assume that d =ande={v,v 2 } E(G). Then F =G e has two components with one component F with only one vertex v and the other component F 2 on n vertices. Let x=e e 2, where e i is a vector with the only nonzero entry a intheith component. Then L(G)=L(F)+xx T. By the Sherman Morrison formality (see, e.g. [8, p 9]), we have Ω(G)=Ω(F) Ω(F)xxT Ω(F) +x T Ω(F)x. Let Ω(F 2 )=(ω ij ) for 2 i,j n. SinceF 2 is a simple graph on n vertices, by the induction hypothesis, ω 22 ω(p n ) with equality if and only if F 2 is a path on n vertices. Therefore, by a calculation, ω = 2+ω 22 2+ω(P n ) =ω(p n) with equality if and only if G is a path on n vertices. 3. MERRIS QUESTION In order to investigate Merris question, we first prove the following lemmas. Lemma 3.. Let T be a tree on vertex set V ={v,...,v n } with doubly stochastic matrix Ω(T)=(ω ij ).If{v i v j } E(T), then ω ij d i d j +d i +d j with equality if and only if n=2. Proof. Without loss of generality, we may assume that i=r, j=r+. Observe that F =T {v i v j } has two components, one component F on vertex set V ={v,...,v r } and the other component F 2 on vertex set V 2 ={v r+,...,v n }. Let x=e r e r+, where e i is a vector with the only nonzero entry a in the ith component. Let Ω(F )=(ω ij ), i,j r and Ω(F 2 )=(ω ij ), r+ i,j n. Then Hence Ω(T)=Ω(F) Ω(F)xxT Ω(F) +x T Ω(F)x. ω rr ω r+,r+ ω r,r+ = +ω. rr +ω r+,r+ By Lemma 2.2, and d r (F )=d r (T), d r+ (F 2 )=d r+ (T), we have ω rr d r (T) +, ω r+,r+ d r+ (T) +
7 0 JOURNAL OF GRAPH THEORY with both equalities if and only if n=2. Therefore, by Lemma 2.2 in [7], ω r,r+ d r d r+ + + d r d r+ = d r d r+ +d r +d r+ with equality if and only if n=2. Remark. When G is a tree, Lemma 3. strengthens Theorem.2, since d i +d j n implies d i d j +d i +d j (n 2 +4n)/4. Hence with the aid of the value of entry of Ω(G), we may judge whether two vertices are adjacent. Lemma 3.2. Let G be a simple graph on vertex set V ={v,...,v n } with doubly stochastic matrix Ω(G)=(ω ij ).Ifd k 2d i, then ω kk <ω ii. Proof. By Equations () and (2) in Lemma 2.2, ω ii ω kk = d k 2d i +(d k +2) v j v i ω ij +(d i +) v j v k ω kj. (3) (d k +2)(d i +) It follows from d k 2d i that ω kk <ω ii. We also need a lemma from [3]. Lemma 3.3 (Merris [3]). Let G be a graph on n vertices {v,...,v n } with doubly stochastic graph matrix Ω(G)=(ω ij ).Thenv k is a least remote vertex if and only if ω kk is a main diagonal minimum entry. Theorem 3.4. Let G be a simple graph on n vertices {v,...,v n }.Ifd k 2d i for all i k, then r(k)=r(g). Proof. By Lemma 3.2, ω kk is the only main diagonal minimum entry. It follows from Lemma 3.3 that v k is a least remote vertex. So r(k)=r(g). Theorem 3.5. Let T be a tree on p+q 3 +q 2 +q+ vertices as in Figure with doubly stochastic graph matrix Ω(T)=(ω ij ).If2(q+) 3 p>q+, thenr(p)>r(t). Proof. Let q L(K,q )=
8 VERTEX DEGREES FIGURE. Tree T. and q e T e T... e T e L(K,q )+e e T L(T )= e 0 L(K,q )+e e T , e L(K,q )+e e T where e is a vector of size q with the only nonzero entry a in the first component. It is easy to see that I +L(K,q )+e e T and I +L(T )+e e T are positive definite. Let A = I +L(K,q )+e e T =(c ij) andb =I +L(T )+e e T =(f ij). Without loss of generality, we may assume that 2I p e e T p q+2 e T... e T I +L(T)= 0 0 e B, e 0... B
9 2 JOURNAL OF GRAPH THEORY where e is a vector of all ones with p components. Clearly, the (,)-entry of (I +L(K,q )) is α=2/(q+2). By some calculations, it is easy to see that c = α +α = 2 q+4. Hence by some calculations, the (,)-entry of (I +L(T )) is β= q+4 q 2 +3q+4 and f = β +β = q+4 q 2 +4q+8. Therefore, by the Schur complement, it is easy to see that the cofactor of (p,p) entry in I +L(T) is equal to 2 p (det B ) q (q+2 qb )=2 p (det B ) q q3 +5q 2 +2q+6 q 2 +4q+8 and the cofactor of (p+,p+) entry in I +L(T) is equal to 2 p (det B ) q p+3 2. Hence ω pp ω p+,p+ = 2p (det B ) q ( q 3 +5q 2 +2q+6 det(i +L(T)) q 2 +4q+8 since 2(q+) 3 p>q+. Hence we finish our proof. p+3 ) >0, 2 Now we present a proof of Theorem.6. Proof of Theorem.6. By Theorem 3.5, for any p and q with 2(q+) 3 p q, we have d(v p )=p+>d(v i ) for all i p and r(p)>r(t). Hence (i) holds. (ii) follows from Theorem 3.4. Lemma 3.6. Let T be a tree on n vertices {v,...,v n } and doubly stochastic graph matrix Ω(T)=(ω ij ).Ifd k 2d i for i k, then r(k)=r(t). Proof. By Lemma 3., Hence ω ij d i v j v i v j v i d i d j +d i +d j di 2 +2d i (d i +2) ω ij 2d2 i d i v j v i di 2 +2d i +. d k d i +d k +d i + 2d i + 2d 2 i +2d i.
10 VERTEX DEGREES 3 By Equation (3) in Lemma 3.2, ω ii ω kk = (d k +2) v j v i ω ij +(d i +) v j v k ω kj (d k +2)(d i +) If follows from Lemma 3.3 that the assertion holds. >0. Remark. By Theorem 3.5, there exists a class of graphs such that Question.5 has a negative answer if d k d i for all i k and d k 2d j 3 for some j k. Moreover, we also show that Question.5 has a positive answer for any tree with d k 2d i by Lemma 3.6. Using MATLAB, we see many examples with d k 2d i 2 that satisfy r(k)=r(g). The author does not know any examples with such parameters that do not satisfy the required condition. We conclude this article with the following question. Question 3.7. Let G be a simple connected graph on n vertices {v,...,v n } with the doubly stochastic graph matrix Ω(G)=(ω ij ).Ifd k =max{d,d 2,...,d n } and d k 2d i 2 for all i k, does r(k)=r(g) hold? ACKNOWLEDGMENTS The author thank the anonymous referees for their kind comments and suggestions. REFERENCES [] A. Berman and X. D. Zhang, A note on the degree antiregular graphs, Linear and Multilinear Algebra 47 (2000), [2] P. Yu. Chebotarev and E. V. Shamis, On the proximity measure for graph vertices provided by the inverse Laplacian characteristic matrix. Abstracts of the Conference Linear Algebra and its Applications, 0 2 July 995, University of Manchester, Manchester, UK, 995, pp Available from: higham/laa95/abstracts.ps [3] P. Yu. Chebotarev and E. V. Shamis, Matrix-forest theorems, arxiv paper math.co/ , 995. Available from: [4] P. Yu. Chebotarev and E. V. Shamis, The matrix-forest theorem and measuring relations in small social groups, Automat Remote Control 58(9) (997), [5] P. Chebotarev and E. V. Shamis, The forest metrics for graph vertices, Electron Notes Discrete Math (2002), [6] P. Chebotarev, Spanning forests and the golden ratio, Discrete Appl Math 56 (2008), [7] V. E. Golender, V. V. Drboglav, and A. B. Rosenblit, Graph potentials method and its application for chemical information processing, J Chem Inf Comput Sci 2 (98), [8] R. A. Horn and C. R. Johnson, Matrix Analysis, Cambridge University Press, London, 985.
11 4 JOURNAL OF GRAPH THEORY [9] M. Kouider and P. Winkler, Mean distance and minimum degree, J Graph Theory 25 (997), [0] R. Merris, The distance spectrum of a tree, J Graph Theory 4 (990), [] R. Merris, Laplacian matrices of graphs: A survey, Linear Algebra Appl 97/98 (994), [2] R. Merris, Doubly stochastic graph matrices, University Beograd Publ Elektrotehn Fak Ser Mat 8 (997), [3] R. Merris, Doubly stochastic graph matrices II, Linear and Multilinear Algebra 45 (998), [4] B. Mohar, Some applications of Laplace eigenvalues of graphs, In: Graph Symmetry: Algebraic Methods and Applications (G. Hahn and G Sabidussi Eds.), Kluwer Academic Publishers, Dordrecht, 997, pp [5] E. Shamis, Graph-theoretic interpretation of the generalized row sum method, Math Social Sci 27 (994), [6] X. D. Zhang and J. X. Wu, Doubly stochastic matrices of trees, Appl Math Lett 8 (2005), [7] X. D. Zhang, A note on doubly stochastic graph matrices, Linear Algebra Appl 407 (2005), , [8] X. D. Zhang, Algebraic connectivity and doubly stochastic tree matrices, Linear Algebra Appl 430 (2009),
2 trees T 1,T 2,...,T
Volume 3, pp 95-305, March 0 http://mathtechnionacil/iic/ela ORDERING TREES BY THE MINIMAL ENTRIES OF THEIR DOUBLY STOCHASTIC GRAPH MATRICES SHUCHAO LI AND QIN ZHAO Abstract Gien an n-ertex graph G, the
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 informationOn the inverse matrix of the Laplacian and all ones matrix
On the inverse matrix of the Laplacian and all ones matrix Sho Suda (Joint work with Michio Seto and Tetsuji Taniguchi) International Christian University JSPS Research Fellow PD November 21, 2012 Sho
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 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 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 informationAnn. Funct. Anal. 5 (2014), no. 2, A nnals of F unctional A nalysis ISSN: (electronic) URL:
Ann Funct Anal 5 (2014), no 2, 127 137 A nnals of F unctional A nalysis ISSN: 2008-8752 (electronic) URL:wwwemisde/journals/AFA/ THE ROOTS AND LINKS IN A CLASS OF M-MATRICES XIAO-DONG ZHANG This paper
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 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 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 informationLinear estimation in models based on a graph
Linear Algebra and its Applications 302±303 (1999) 223±230 www.elsevier.com/locate/laa Linear estimation in models based on a graph R.B. Bapat * Indian Statistical Institute, New Delhi 110 016, India Received
More informationInequalities for the spectra of symmetric doubly stochastic matrices
Linear Algebra and its Applications 49 (2006) 643 647 wwwelseviercom/locate/laa Inequalities for the spectra of symmetric doubly stochastic matrices Rajesh Pereira a,, Mohammad Ali Vali b a Department
More 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 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 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 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 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 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 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 informationOn Euclidean distance matrices
On Euclidean distance matrices R. Balaji and R. B. Bapat Indian Statistical Institute, New Delhi, 110016 November 19, 2006 Abstract If A is a real symmetric matrix and P is an orthogonal projection onto
More informationThe spectrum of the edge corona of two graphs
Electronic Journal of Linear Algebra Volume Volume (1) Article 4 1 The spectrum of the edge corona of two graphs Yaoping Hou yphou@hunnu.edu.cn Wai-Chee Shiu Follow this and additional works at: http://repository.uwyo.edu/ela
More informationLaplacian spectral radius of trees with given maximum degree
Available online at www.sciencedirect.com Linear Algebra and its Applications 429 (2008) 1962 1969 www.elsevier.com/locate/laa Laplacian spectral radius of trees with given maximum degree Aimei Yu a,,1,
More 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 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 informationLaplacian eigenvalues and optimality: II. The Laplacian of a graph. R. A. Bailey and Peter Cameron
Laplacian eigenvalues and optimality: II. The Laplacian of a graph R. A. Bailey and Peter Cameron London Taught Course Centre, June 2012 The Laplacian of a graph This lecture will be about the Laplacian
More informationSome constructions of integral graphs
Some constructions of integral graphs A. Mohammadian B. Tayfeh-Rezaie School of Mathematics, Institute for Research in Fundamental Sciences (IPM), P.O. Box 19395-5746, Tehran, Iran ali m@ipm.ir tayfeh-r@ipm.ir
More informationRESISTANCE DISTANCE IN WHEELS AND FANS
Indian J Pure Appl Math, 41(1): 1-13, February 010 c Indian National Science Academy RESISTANCE DISTANCE IN WHEELS AND FANS R B Bapat 1 and Somit Gupta Indian Statistical Institute, New Delhi 110 016,
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 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 informationMinimum number of non-zero-entries in a 7 7 stable matrix
Linear Algebra and its Applications 572 (2019) 135 152 Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa Minimum number of non-zero-entries in a
More informationRATIONAL REALIZATION OF MAXIMUM EIGENVALUE MULTIPLICITY OF SYMMETRIC TREE SIGN PATTERNS. February 6, 2006
RATIONAL REALIZATION OF MAXIMUM EIGENVALUE MULTIPLICITY OF SYMMETRIC TREE SIGN PATTERNS ATOSHI CHOWDHURY, LESLIE HOGBEN, JUDE MELANCON, AND RANA MIKKELSON February 6, 006 Abstract. A sign pattern is a
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 informationHierarchical open Leontief models
Available online at wwwsciencedirectcom Linear Algebra and its Applications 428 (2008) 2549 2559 wwwelseviercom/locate/laa Hierarchical open Leontief models JM Peña Departamento de Matemática Aplicada,
More informationELA A LOWER BOUND FOR THE SECOND LARGEST LAPLACIAN EIGENVALUE OF WEIGHTED GRAPHS
A LOWER BOUND FOR THE SECOND LARGEST LAPLACIAN EIGENVALUE OF WEIGHTED GRAPHS ABRAHAM BERMAN AND MIRIAM FARBER Abstract. Let G be a weighted graph on n vertices. Let λ n 1 (G) be the second largest eigenvalue
More informationSome bounds for the spectral radius of the Hadamard product of matrices
Some bounds for the spectral radius of the Hadamard product of matrices Guang-Hui Cheng, Xiao-Yu Cheng, Ting-Zhu Huang, Tin-Yau Tam. June 1, 2004 Abstract Some bounds for the spectral radius of the Hadamard
More informationApplicable Analysis and Discrete Mathematics available online at
Applicable Analysis and Discrete Mathematics available online at http://pefmath.etf.rs Appl. Anal. Discrete Math. 8 (2014), 330 345. doi:10.2298/aadm140715008z LAPLACIAN COEFFICIENTS OF UNICYCLIC GRAPHS
More informationIntrinsic products and factorizations of matrices
Available online at www.sciencedirect.com Linear Algebra and its Applications 428 (2008) 5 3 www.elsevier.com/locate/laa Intrinsic products and factorizations of matrices Miroslav Fiedler Academy of Sciences
More 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 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 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 informationBipartite graphs with at most six non-zero eigenvalues
Also available at http://amc-journal.eu ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 11 (016) 315 35 Bipartite graphs with at most six non-zero eigenvalues
More 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 informationarxiv: v1 [math.co] 6 Feb 2011
arxiv:1102.1144v1 [math.co] 6 Feb 2011 ON SUM OF POWERS OF LAPLACIAN EIGENVALUES AND LAPLACIAN ESTRADA INDEX OF GRAPHS Abstract Bo Zhou Department of Mathematics, South China Normal University, Guangzhou
More 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 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 informationELA
THE DISTANCE MATRIX OF A BIDIRECTED TREE R. B. BAPAT, A. K. LAL, AND SUKANTA PATI Abstract. A bidirected tree is a tree in which each edge is replaced by two arcs in either direction. Formulas are obtained
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 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 informationOn some matrices related to a tree with attached graphs
On some matrices related to a tree with attached graphs R. B. Bapat Indian Statistical Institute New Delhi, 110016, India fax: 91-11-26856779, e-mail: rbb@isid.ac.in Abstract A tree with attached graphs
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 informationGraphs and Their Applications (7)
11111111 I I I Graphs and Their Applications (7) by K.M. Koh* Department of Mathematics National University of Singapore, Singapore 117543 F.M. Dong and E.G. Tay Mathematics and Mathematics Education National
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 informationIdentities for minors of the Laplacian, resistance and distance matrices
Identities for minors of the Laplacian, resistance and distance matrices R. B. Bapat 1 Indian Statistical Institute New Delhi, 110016, India e-mail: rbb@isid.ac.in Sivaramakrishnan Sivasubramanian Department
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 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 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 informationACI-matrices all of whose completions have the same rank
ACI-matrices all of whose completions have the same rank Zejun Huang, Xingzhi Zhan Department of Mathematics East China Normal University Shanghai 200241, China Abstract We characterize the ACI-matrices
More informationThe minimum rank of matrices and the equivalence class graph
Linear Algebra and its Applications 427 (2007) 161 170 wwwelseviercom/locate/laa The minimum rank of matrices and the equivalence class graph Rosário Fernandes, Cecília Perdigão Departamento de Matemática,
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 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 informationAverage distance, radius and remoteness of a graph
Also available at http://amc-journal.eu ISSN 855-3966 (printed edn.), ISSN 855-397 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 7 (0) 5 Average distance, radius and remoteness of a graph Baoyindureng
More informationOn the 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 informationA note on 5 5 Completely positive matrices
A note on 5 5 Completely positive matrices Hongbo Dong and Kurt Anstreicher October 2009; revised April 2010 Abstract In their paper 5 5 Completely positive matrices, Berman and Xu [BX04] attempt to characterize
More informationA necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees
A necessary and sufficient condition for the existence of a spanning tree with specified vertices having large degrees Yoshimi Egawa Department of Mathematical Information Science, Tokyo University of
More informationNotes on the Matrix-Tree theorem and Cayley s tree enumerator
Notes on the Matrix-Tree theorem and Cayley s tree enumerator 1 Cayley s tree enumerator Recall that the degree of a vertex in a tree (or in any graph) is the number of edges emanating from it We will
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 informationShort proofs of theorems of Mirsky and Horn on diagonals and eigenvalues of matrices
Electronic Journal of Linear Algebra Volume 18 Volume 18 (2009) Article 35 2009 Short proofs of theorems of Mirsky and Horn on diagonals and eigenvalues of matrices Eric A. Carlen carlen@math.rutgers.edu
More informationII. Determinant Functions
Supplemental Materials for EE203001 Students II Determinant Functions Chung-Chin Lu Department of Electrical Engineering National Tsing Hua University May 22, 2003 1 Three Axioms for a Determinant Function
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 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 informationA Bound on the Number of Spanning Trees in Bipartite Graphs
A Bound on the Number of Spanning Trees in Bipartite Graphs Cheng Wai Koo Mohamed Omar, Advisor Nicholas Pippenger, Reader Department of Mathematics May, 2016 Copyright 2016 Cheng Wai Koo. The author grants
More informationGraph fundamentals. Matrices associated with a graph
Graph fundamentals Matrices associated with a graph Drawing a picture of a graph is one way to represent it. Another type of representation is via a matrix. Let G be a graph with V (G) ={v 1,v,...,v n
More informationThe Singular Acyclic Matrices of Even Order with a P-Set of Maximum Size
Filomat 30:13 (016), 3403 3409 DOI 1098/FIL1613403D Published by Faculty of Sciences and Mathematics, University of Niš, Serbia Available at: http://wwwpmfniacrs/filomat The Singular Acyclic Matrices of
More informationBOUNDS FOR LAPLACIAN SPECTRAL RADIUS OF THE COMPLETE BIPARTITE GRAPH
Volume 115 No. 9 017, 343-351 ISSN: 1311-8080 (printed version); ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu BOUNDS FOR LAPLACIAN SPECTRAL RADIUS OF THE COMPLETE BIPARTITE GRAPH
More informationOn 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 informationCospectrality of graphs
Linear Algebra and its Applications 451 (2014) 169 181 Contents lists available at ScienceDirect Linear Algebra and its Applications www.elsevier.com/locate/laa Cospectrality of graphs Alireza Abdollahi
More 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 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 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 informationSpectrally arbitrary star sign patterns
Linear Algebra and its Applications 400 (2005) 99 119 wwwelseviercom/locate/laa Spectrally arbitrary star sign patterns G MacGillivray, RM Tifenbach, P van den Driessche Department of Mathematics and Statistics,
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 informationThe doubly negative matrix completion problem
The doubly negative matrix completion problem C Mendes Araújo, Juan R Torregrosa and Ana M Urbano CMAT - Centro de Matemática / Dpto de Matemática Aplicada Universidade do Minho / Universidad Politécnica
More informationProduct distance matrix of a tree with matrix weights
Product distance matrix of a tree with matrix weights R B Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India email: rbb@isidacin Sivaramakrishnan Sivasubramanian
More informationRANKS OF QUANTUM STATES WITH PRESCRIBED REDUCED STATES
RANKS OF QUANTUM STATES WITH PRESCRIBED REDUCED STATES CHI-KWONG LI, YIU-TUNG POON, AND XUEFENG WANG Abstract. Let M n be the set of n n complex matrices. in this note, all the possible ranks of a bipartite
More informationHOMEWORK 9 solutions
Math 4377/6308 Advanced Linear Algebra I Dr. Vaughn Climenhaga, PGH 651A Fall 2013 HOMEWORK 9 solutions Due 4pm Wednesday, November 13. You will be graded not only on the correctness of your answers but
More informationAlgebra & Trig. I. For example, the system. x y 2 z. may be represented by the augmented matrix
Algebra & Trig. I 8.1 Matrix Solutions to Linear Systems A matrix is a rectangular array of elements. o An array is a systematic arrangement of numbers or symbols in rows and columns. Matrices (the plural
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 informationTrees. A tree is a graph which is. (a) Connected and. (b) has no cycles (acyclic).
Trees A tree is a graph which is (a) Connected and (b) has no cycles (acyclic). 1 Lemma 1 Let the components of G be C 1, C 2,..., C r, Suppose e = (u, v) / E, u C i, v C j. (a) i = j ω(g + e) = ω(g).
More informationNote on the normalized Laplacian eigenvalues of signed graphs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 44 (2009), Pages 153 162 Note on the normalized Laplacian eigenvalues of signed graphs Hong-hai Li College of Mathematic and Information Science Jiangxi Normal
More informationarxiv: v1 [math.co] 10 Aug 2016
POLYTOPES OF STOCHASTIC TENSORS HAIXIA CHANG 1, VEHBI E. PAKSOY 2 AND FUZHEN ZHANG 2 arxiv:1608.03203v1 [math.co] 10 Aug 2016 Abstract. Considering n n n stochastic tensors (a ijk ) (i.e., nonnegative
More informationORIE 6334 Spectral Graph Theory September 8, Lecture 6. In order to do the first proof, we need to use the following fact.
ORIE 6334 Spectral Graph Theory September 8, 2016 Lecture 6 Lecturer: David P. Williamson Scribe: Faisal Alkaabneh 1 The Matrix-Tree Theorem In this lecture, we continue to see the usefulness of the graph
More informationMATH 1210 Assignment 4 Solutions 16R-T1
MATH 1210 Assignment 4 Solutions 16R-T1 Attempt all questions and show all your work. Due November 13, 2015. 1. Prove using mathematical induction that for any n 2, and collection of n m m matrices A 1,
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 informationProperties for the Perron complement of three known subclasses of H-matrices
Wang et al Journal of Inequalities and Applications 2015) 2015:9 DOI 101186/s13660-014-0531-1 R E S E A R C H Open Access Properties for the Perron complement of three known subclasses of H-matrices Leilei
More informationUpper bounds on algebraic connectivity via convex optimization
Linear Algebra and its Applications 418 (2006) 693 707 www.elsevier.com/locate/laa Upper bounds on algebraic connectivity via convex optimization Arpita Ghosh, Stephen Boyd Department of Electrical Engineering,
More informationResearch Article The Adjacency Matrix of One Type of Directed Graph and the Jacobsthal Numbers and Their Determinantal Representation
Applied Mathematics Volume 20, Article ID 423163, 14 pages doi:101155/20/423163 Research Article The Adjacency Matrix of One Type of Directed Graph and the Jacobsthal Numbers and Their Determinantal Representation
More informationPascal Eigenspaces and Invariant Sequences of the First or Second Kind
Pascal Eigenspaces and Invariant Sequences of the First or Second Kind I-Pyo Kim a,, Michael J Tsatsomeros b a Department of Mathematics Education, Daegu University, Gyeongbu, 38453, Republic of Korea
More informationImproved Newton s method with exact line searches to solve quadratic matrix equation
Journal of Computational and Applied Mathematics 222 (2008) 645 654 wwwelseviercom/locate/cam Improved Newton s method with exact line searches to solve quadratic matrix equation Jian-hui Long, Xi-yan
More informationSolution of the Inverse Eigenvalue Problem for Certain (Anti-) Hermitian Matrices Using Newton s Method
Journal of Mathematics Research; Vol 6, No ; 014 ISSN 1916-9795 E-ISSN 1916-9809 Published by Canadian Center of Science and Education Solution of the Inverse Eigenvalue Problem for Certain (Anti-) Hermitian
More information