Average Mixing Matrix of Trees
|
|
- Denis Blake
- 6 years ago
- Views:
Transcription
1 Electronic Journal of Linear Algebra Volume 34 Volume Article 9 08 Average Mixing Matrix of Trees Chris Godsil University of Waterloo, cgodsil@uwaterloo.ca Krystal Guo Université libre de Bruxelles, kguo@uwaterloo.ca John Sinkovic University of Waterloo, john.sinkovic@uwaterloo.ca Follow this and additional works at: Part of the Discrete Mathematics and Combinatorics Commons Recommended Citation Godsil, Chris; Guo, Krystal; and Sinkovic, John. 08, "Average Mixing Matrix of Trees", Electronic Journal of Linear Algebra, Volume 34, 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 Electronic Journal of Linear Algebra, ISSN Volume 34, pp. 69-8, May 08. AVERAGE MIXING MATRIX OF TREES CHRIS GODSIL, KRYSTAL GUO, AND JOHN SINKOVIC Abstract. The rank of the average mixing matrix of trees with all eigenvalues distinct, is investigated. The rank of the average mixing matrix of a tree on n vertices with n distinct eigenvalues is bounded above by n/. Computations on trees up to 0 vertices suggest that the rank attains this upper bound most of the times. An infinite family of trees whose average mixing matrices have ranks which are bounded away from this upper bound, is given. A lower bound on the rank of the average mixing matrix of a tree, is also given. Key words. Algebraic graph theory, Eigenspaces, Quantum walks. AMS subject classifications. 8P68, 05C50, 8P6.. Introduction. We investigate the rank of the average mixing matrix of continuous time quantum walks on trees with all simple eigenvalues. The continuous-time quantum walk is a universal computational primitive [4]. Since their introduction in [7], many properties of quantum walks have been studied. Some topics include state transfer [5,, 4, 6] and uniform mixing [, 3, 3]. Let X be a graph and let A be the adjacency matrix of X. The transition matrix of a continuous-time quantum walk on X is a matrix-valued function in time, denoted Ut, and is given as follows: Ut = expita. Unlike a classical random walk on a connected graph, a continuous quantum walk does not reach a stationary distribution. For example, the transition of the complete graph K n is a periodic function of t. The average mixing matrix is, intuitively, a distribution that the quantum walk adheres to, on average, over time, and thus, may be thought of as a replacement for a stationary distribution. The average mixing matrix has been studied in [, 6, ]. We will now proceed with a few preliminary definitions. The mixing matrix Mt of the quantum walk, given by Mt = Ut Ut. where denotes the Schur also known as the Hadamard or element-wise product of two matrices. The average mixing matrix, denoted M, is defined as follows:. M = lim T T T 0 Mt dt. Received by the editors on February 7, 08. Accepted for publication on April 6, 08. Handling Editor: Bryan L. Shader. Corresponding Author: Krystal Guo. University of Waterloo, Waterloo, Canada cgodsil@uwaterloo.ca. C. Godsil gratefully acknowledges the support of the Natural Sciences and Engineering Council of Canada NSERC, grant no. RGPIN Université libre de Bruxelles, Brussels, Belgium guo.krystal@gmail.com. This work was done when K. Guo was a postdoctoral fellow at the University of Waterloo. University of Waterloo, Waterloo, Canada john.sinkovic@uwaterloo.ca.
3 Electronic Journal of Linear Algebra, ISSN Volume 34, pp. 69-8, May 08. Chris Godsil, Krystal Guo, and John Sinkovic 70 A tree is a connected graph with no cycles. The class of trees is a natural class of graphs to study, since it is a smaller class of graphs with well-understood combinatorial properties and eigenvalues. Trees have the desirable property of being sparse and initial data for the rank of the average mixing matrix prompted further study of the class. The rank of the average mixing matrix of a tree on n vertices with n distinct eigenvalues is at most n /, see [6]. We computed the rank of the average mixing matrix of all trees up to 0 vertices; the computational results suggest that the rank of M of a tree with all simple eigenvalues attains the upper bound most of the time. We give an infinite family of trees whose average mixing matrices have ranks which are bounded away from this upper bound. Theorem.. For every positive real number c, there exists a tree T on n vertices with all simple eigenvalues such that n rk MT > c. We then give the following lower bound on the rank of the average mixing matrix of a tree: Theorem.. If T is a tree with all simple eigenvalues on at least four vertices and is not isomorphic to P 4, then rk MT 3. We give some preliminary results about the average mixing matrix in Section. We also find the ranks and traces of the average mixing matrices of star graphs, as an example. In Section 3, we define the rooted product of graphs and we find the average mixing matrix of the rooted product of X and Y = {K,..., K } in terms of the eigenprojectors of X. We use this result in Section 4 to give a family of trees whose average mixing matrices have ranks which are upper-bounded away from the maximum. In Section 5, we prove the lower bound on the ranks of the average mixing matrices of trees which are not isomorphic to the path on four vertices.. Preliminaries and examples. Let X be a graph on n vertices and let A be the adjacency matrix of X. Let θ,..., θ d be the distinct eigenvalues of A and, for r =,..., d, let E r be the idempotent projection onto the θ r eigenspace of A; the spectral decomposition of A is as follows: A = d θ r E r. The following is an important theorem as it allows us to understand the average mixing matrix. r= Theorem.. [] Let X be a graph and let A be the adjacency matrix of X. Let A = d r= θ re r be the spectral decomposition of A. The average mixing matrix of X is M = d E r E r. r= As an example, we find the average mixing matrix of the star and deduce that it always has full rank. Lemma.. The average mixing matrix of the star graph K,n has full rank and has tr M = n 3n + 3. n
4 Electronic Journal of Linear Algebra, ISSN Volume 34, pp. 69-8, May Average Mixing Matrix of Trees Proof. We will proceed by finding an explicit expression for MK,n. Observe that the eigenvalues of K,n are ± n and 0 with multiplicity n. We give the spectral idempotent matrices as follows: E n = n T n n J, E n = n T n n J and E 0 = I n J, where I is the n n identity matrix and J is the n n all ones matrix. Note that I nj always has rank n. Thus we have that MK,n = E n + E = = n T n n 3 n + E 0 n J + n T n J + n I n I + n J. We can now observe that this matrix has full rank; we can easily see that the lower n n matrix does not have 0 as an eigenvalue and adding the first row and column does not introduce any linear dependencies. rk M = 3 P 6 E 6 ˆD5 rk M = 5 rk M = 6 D 6 T K,5 Figure. All trees on 6 vertices, organized by the rank of their average mixing matrices. The path graphs P and P 3 are the only trees on two and three vertices, respectively. There are six trees on six vertices; three of them have all simple eigenvalues and rank 3, two have rank 4 and one graph the star graph of full rank. They are shown in Figure.
5 Electronic Journal of Linear Algebra, ISSN Volume 34, pp. 69-8, May 08. Chris Godsil, Krystal Guo, and John Sinkovic 7 3. Rooted products. Let X be a graph with vertices {v,..., v n } and let Y be a disjoint union of rooted graphs Y,..., Y n, rooted at y,..., y n, respectively. The rooted product of X and Y, denoted XY, is the graph obtain by identifying v i with the root vertex of Y i. The rooted product was first introduced by Godsil and McKay in [8]. Let φy i, t denote the characteristic polynomial of Y i and let BX, Y be the matrix given as follows: φy i, t, if i = j; BX, Y i,j = φy i \ y i, t, if i j; 0, otherwise. Theorem 3.. [8] φxy, t = detb. In particular, we will consider the special case where Y is a sequence of n copies of K. In this case, we will write XK to denote the rooted product and the following is found in [8] as a consequence of the above theorem 3. φxk, t = t n φ H, t. t The following lemma follows directly from 3.. Lemma 3.. Let X be a graph with all simple eigenvalues. The rooted product XK also has all simple eigenvalues which are roots of for λ an eigenvalue of X. t λt = 0, Lemma 3.3. Let X be a graph with all simple eigenvalues and let {v,..., v n } be an orthonormal eigenbasis of AX with eigenvalues λ,..., λ n, respectively. For i =,..., n, let µ i and ν i be the two roots of t λ i t = 0. Then { µi v i µ i + v i is an orthonormal eigenbasis for XK., ν i + Proof. We may write the adjacency matrix of XK as follows: AXK = } νi v i i =,..., n v i AX I. I 0 For i [n] and µ {µ i, ν i }, we see that µ 0 and µ = λµ +. We obtain that and the lemma follows. AX I µvi λi µv = i + v i µ v = i µvi = µ, I 0 v i µv i µv i v i
6 Electronic Journal of Linear Algebra, ISSN Volume 34, pp. 69-8, May Average Mixing Matrix of Trees Theorem 3.4. Let X be a graph with all simple eigenvalues and let F,..., F n the orthogonal projections onto the eigenspaces of AX with corresponding eigenvalues λ,..., λ n. Then MX N N MXK =, N MX N where N = n i= λ i + 4 F i F i. Proof. Following the notation of the previous lemma, we see that F i = v i v T i. For i [n], let µ {µ i, ν i }. The orthogonal projection E µ onto the µ eigenspace of AXK is given by µ + µvi v i µv T i v T i µ v = i vi T µv i vi T µ + µv i vi T v i vi T = µ + µ F i µf i µf i F i. Thus, E µi E µi + E νi E νi = µ 4 i + ν 4 i µ i + ν i + µ i + ν i µ i + νi + F i F i F i F i µ i + ν i µ i + νi + + µ i + νi + F i F i. F i F i Observe that µ i + ν i = λ i and µ i ν i =, and so µ i + ν i = µ i + ν i µ i ν i = λ i + and µ 4 i + ν 4 i = λ 4 i + 4µ i + 4ν i 6 = λ 4 i + 4λ i +. We obtain that µ 4 i µ + νi 4 i + ν = µ4 i ν i + + ν 4 i µ i + = λ4 i + 6µ i + 6ν i 4 i + µ i + νi + λ i + = λ i + 4 λ i + 4, and µ i µ + νi i + ν = µ i ν i + + ν i µ i + = λ i + 8 i + µ i + νi + λ i + = 4 λ i + 4 µ i + + ν i + = ν i + + µ i + µ i + ν i + = λ i + λ i + 4.
7 Electronic Journal of Linear Algebra, ISSN Volume 34, pp. 69-8, May 08. Chris Godsil, Krystal Guo, and John Sinkovic 74 Thus, λ i + E µi E µi + E νi E νi = λ i +4 F i F i λ i +4 F i F i λ i +4 F i F i λ i +. λ i +4 F i F i Let We can see that N = n i= λ i + 4 F i F i. MX N N MXK =, N MX N and the lemma follows. We observe that N and M have the same kernel. 4. Trees with all simple eigenvalues with rk M bounded away from n /. The following lemma is found in [6]. Lemma 4.. [6] If X is a bipartite graph on n vertices with n distinct eigenvalues, then rk MX n /. In this section, we will give a construction for trees on n vertices with all simple eigenvalues where rk M is bounded away from n /. A computer search finds that for n =,..., 7, 9, 0, every tree on n vertices with all simple eigenvalues has rk M = n /. Up to isomorphism, there is one tree T on 8 vertices such that rk MT = 8, which is given in Figure. We will retain the notation of T to denote this for the rest of this section Figure. The tree T on 8 vertices such that MT = 8.
8 Electronic Journal of Linear Algebra, ISSN Volume 34, pp. 69-8, May Average Mixing Matrix of Trees We will need the following technical lemma. Lemma 4.. Let X be a graph with adjacency matrix A. Suppose the spectral decomposition AX = d r=0 θ re r. Let M be the average mixing matrix of X. We have that d ker M = kere r E r. Proof. Let v ker M. We see that d 0 = v T Mv = v T E r E r v. Since E r E r is a principal submatrix of E r E r and is hence positive semi-definite, we see that r=0 r=0 v T E r E r v 0 for all r. Since the sum of non-negative real number is equal to zero, every term must be zero, and thus, d ker M kere r E r. Containment in the other direction is clear. r=0 We will use Lemma 4. to bound the rank of iterated rooted products of T with K. We note that Lemma 4. implies that vertices u and v are strongly cospectral in X if and only if Me u = Me v, which is also proven in []. The characteristic polynomial of T is which has all simple roots. φt, x =x x + x x x + x ] x 3 x x + Let X 0 = T and X i+ = X i K for i > 0. x 3 + x x x 6 8x 4 + x, Lemma 4.3. For i 0, the graph X i has all simple eigenvalues and rk MX i i+3. Proof. We proceed by induction on i. We computed that rk MT = 8 and T has all simple eigenvalues. Suppose the statement is true for i >. By Lemma 3., the graph X i+ has all simple eigenvalues. For simplicity, let n = i 8, the number of vertices of X i. Let F,..., F n be the orthogonal projections onto the eigenspaces of AX i with corresponding eigenvalues λ,..., λ n. Theorem 3.4 gives that MXi N N MX i+ =, N MXi N
9 Electronic Journal of Linear Algebra, ISSN Volume 34, pp. 69-8, May 08. Chris Godsil, Krystal Guo, and John Sinkovic 76 where N = n λ j + 4 F j F j. j= Let v ker MX i. By Lemma 4., we see that v kerf j F j for all j, and thus, Nv = 0. Let 0 m denote the m dimensional all zero vector. We have v MX i+ = 0 n MXi N N N v = 0 n MXi N 0 n and 0n MXi N MX i+ = v N 0n N = 0 n. MXi N v Thus, if {v k } k is an orthogonal basis for ker MX i, then { vk is a set of dim ker MX i vectors in ker MX i+, and the statement follows. 0 n, Theorem 4.4. For every positive real number c, there exists a tree T with all simple eigenvalues such that V T 0n v k } k rk MT > c. Proof. Note that X i as constructed above is a tree on i 8 vertices such that V Xi rk MX i i 8 i 8 = i. For any c > 0, we pick i such that i > c, and the result follows. 5. Lower bound on rank. We denote by X \u the graph obtained from X by deleting vertex u. The coefficient matrix of a graph X is the matrix C with rows indexed by the vertices of X and columns indexed by integers [n] such that the u, r entry of C is the coefficient of t r in the characteristic polynomial φx\u, t. We will see that for graphs with all simple eigenvalues, the coefficient matrix is useful in studying the average mixing matrix. The following lemma appears in the proof of [, Theorem 3.]. Lemma 5.. [] Let X be a graph on n vertices with n distinct eigenvalues θ,..., θ n. Let be the n n diagonal matrix whose r-th diagonal entry is φ X, θ r. Let V be the n n Vandermonde matrix with ij-entry equal to θ i j. Then MX = CV V T C T. From this, we derive the following corollary as a direct consequence.
10 Electronic Journal of Linear Algebra, ISSN Volume 34, pp. 69-8, May Average Mixing Matrix of Trees Corollary 5.. If X is a graph with all simple eigenvalues, then rk MX is equal to the rank of the coefficient matrix. We will also use this standard fact, which can be found in [0], for example. Lemma 5.3. If T is a tree, then the characteristic polynomial of T is equal to the matching polynomial of T. Lemma 5.4 is Corollary 8.9. in [9]. Lemma 5.4. [9] If A is a symmetric matrix of rank r, then it has a principal submatrix of full rank. Corollary 5.5 follows from Lemma 5.4 and the fact that a tree has a perfect matching if and only if its adjacency matrix has full rank. Corollary 5.5. If T is a tree with all simple eigenvalues, then either T has a perfect matching or there exists a vertex v such that T \ v has a perfect matching. Proof. If T is a tree with all simple eigenvalues, then zero can have multiplicity at most one. If the multiplicity of zero is zero, then T has a perfect matching. If the multiplicity of zero is one, then the rank of AT is T. Thus, by Lemma 5.4, AT has T T principal submatrix of full rank. Thus, there exists a vertex v such that AT \ v has full rank. It follows that T \ v has a perfect matching. Lemma 5.6. If T is a tree with all simple eigenvalues, and T 3, then T has a leaf adjacent to a vertex of degree two. Proof. The path on three vertices satisfies the conclusion of the lemma. Let T be a tree with all simple eigenvalues and T 4. Consider a diametrical path P = {v 0,..., v d } of T. Since the star on n 4 vertices does not have all simple eigenvalues, d 3. Since P is a diametrical path of length at least three, v and v d are distinct and adjacent to exactly one non-leaf vertex of T. If either v or v d has degree two, then we are done. Suppose by way of contradiction, that both vertices have degree greater than two. Deleting v and v d from T yields a graph with at least four isolated vertices. As each isolated vertex contributes a zero eigenvalue, the multiplicity of zero is at least four. Since the eigenvalues of induced subgraphs interlace, the multiplicity of the zero eigenvalue of T is at least. This contradicts that T has all simple eigenvalues. Theorem 5.7. If T is a tree with all simple eigenvalues on at least four vertices and is not isomorphic to P 4, then rk MT 3. Proof. In light of Corollary 5., it is sufficient to show that the rank of the coefficient matrix of a tree is at least three. By Lemma 5.6, T has a leaf u adjacent to a vertex v of degree two. Let w be the non-leaf neighbor of v with degw = l. Let m α T denote the number of matchings of size α in T. By Lemma 5.3, the ith row of the coefficient matrix of T can be expressed in terms of m α T \i for the appropriate value of α. Case : T has a perfect matching. As T has a perfect matching, n = T is even. The only tree on four vertices with a perfect matching is P 4. It has two pairs of cospectral vertices, and thus, rk MP 4 =. For the remainder of this case, assume that n 6. Consider the 3 3 submatrix C of the coefficient matrix of T with rows corresponding to u, v, w
11 Electronic Journal of Linear Algebra, ISSN Volume 34, pp. 69-8, May 08. Chris Godsil, Krystal Guo, and John Sinkovic 78 and columns corresponding to t, t n 3, and t n. For simplicity in the notation let k = n /. Then k m k T \ u m T \ u m 0 T \ u C = m k T \ v m T \ v m 0 T \ v. k m k T \ w m T \ w m 0 T \ w As m 0 T \i is defined to be and m T \i is the number of edges in T \i, it remains to determine the values of the first column. In T \ u, the set of matchings of size k can be partitioned into two sets: the k matchings which use edge vw and those that do not. Thus m k T \ u = m k T \ {u, v, w} + m k T \ {u, v}. Since T has a perfect matching and every perfect matching of T contains the edge uv, we have that T \ {u, v} also contains a perfect matching. Thus m k T \ {u, v} =. Similarly, m k T \ v =. Since T \ w has uv as a component and any matching of size k uses uv, we see that m k T \ w = m k T \ {u, v, w}. Letting q = m k T \ {u, v, w}, we obtain k q + n C = k n 3 k q n l and det C = k + q l. Note that det C = 0 if and only if l = + /q. As l N, this occurs if and only if q = and l =. We claim that if l =, then q. Let y be the other neighbor of w. Since T has a perfect matching, so does T \ {u, v, w, y}. Thus m k T \ {u, v, w, y} = and T \ {u, v, w} has a k matching which uses no edge incident to y. Since n 6, degy. Thus T \ {u, v, w} has at least one k matching which uses an edge incident to y. Therefore q = m k T \ {u, v, w}. Further det C 0 and the coefficient matrix of T has rank at least 3. Case : T does not have a perfect matching. There are two possibilities to consider; either T \ u has a perfect matching or it does not. In the case that T \u has a perfect matching, n = T is odd and so T 5. Consider the 3 3 submatrix C of the coefficient matrix of T with rows corresponding to u, v, w and columns corresponding to t 0, t n 3, and t n. For simplicity in the notation let n / = j. Then
12 Electronic Journal of Linear Algebra, ISSN Volume 34, pp. 69-8, May Average Mixing Matrix of Trees j m j T \ u m T \ u m 0 T \ u C = m j T \ v m T \ v m 0 T \ v. j m j T \ w m T \ w m 0 T \ w As stated in Case, m 0 T \ i = and m T \ i is the number of edges in T \ i. Matchings of size j = n / are perfect matchings in a graph on n vertices. Further since T \u has a perfect matching so does T \ w. Lastly, T \ v does not have a perfect matching as u is isolated by deleting v. Thus, j n C = 0 n 3. j n l Note that det C = j l. Since degw = l, C has full rank and so the coefficient matrix of T has rank at least three. We now consider the other possibility mentioned at the start of this case. Assume that T \ u does not have a perfect matching. By Corollary 5.5 there exists a vertex z of degree f such that T z has a perfect matching. Thus, n = T is odd and n 5. Consider the 3 3 submatrix C 3 of the coefficient matrix of T with rows corresponding to u, v, z and columns corresponding to t 0, t n 3, and t n. For simplicity in the notation let n / = j. Then j m j T \ u m T \ u m 0 T \ u C 3 = m j T \ v m T \ v m 0 T \ v. j m j T \ z m T \ z m 0 T \ z As in the other cases, the entries of the last two columns are easily filled. The entries in the first column are determined by whether T \ i has a perfect matching. Thus, 0 n C 3 = 0 n 3. j n f Note that det C 3 = j+ 0. Thus, C 3 has full rank and so the coefficient matrix of T has rank at least three. 6. Computational data. Computations of average mixing matrices of trees on up to 0 were carried out, using Sage Mathematics Software [5]. The results are recorded in Tables and. For each order n and rank r, we record the number of trees on n vertices whose average mixing matrix has rank r and, amongst those, the number with n distinct eigenvalues.
13 Electronic Journal of Linear Algebra, ISSN Volume 34, pp. 69-8, May 08. Chris Godsil, Krystal Guo, and John Sinkovic 80 n rank # trees # simple eigenvalues n rank # trees # simple eigenvalues Table Ranks of average mixing matrices of trees on to 4 vertices. 7. Open problems. In Section 5, we give a constant lower on the rank of the average mixing matrix of trees with all simple eigenvalues on at least 4 vertices. Table 3 shows the minimum ranks among the average mixing matrices of trees of n vertices.
14 Electronic Journal of Linear Algebra, ISSN Volume 34, pp. 69-8, May Average Mixing Matrix of Trees n rank # trees # simple eigenvalues n rank # trees # simple eigenvalues Table Ranks of average mixing matrices of trees on 5 to 0 vertices. n min rank Table 3 The minimum ranks of the average mixing matrices of trees on n vertices, for n =,..., 0.
15 Electronic Journal of Linear Algebra, ISSN Volume 34, pp. 69-8, May 08. Chris Godsil, Krystal Guo, and John Sinkovic 8 Finally, we are motivated by the computational data to ask the following question: Conjecture 7.. For any k, the number of trees T such that the rank of the average mixing matrix of T is at most k is finite. REFERENCES [] W. Adamczak, K. Andrew, L. Bergen, D. Ethier, P. Hernberg, J. Lin, and C. Tamon. Non-uniform mixing of quantum walk on cycles. International Journal of Quantum Information, 5:78 793, 007. [] W. Adamczak, K. Andrew, P. Hernberg, and C. Tamon. A note on graphs resistant to quantum uniform mixing. Preprint, arxiv:quant-ph/ , 003. [3] A. Chan. Complex Hadamard matrices, instantaneous uniform mixing and cubes. Preprint, arxiv:305.58, 03. [4] A.M. Childs. Universal computation by quantum walk. Physical Review Letters, 0:8050, 009. [5] G. Coutinho, C. Godsil, K. Guo, and F. Vanhove. Perfect state transfer on distance-regular graphs and association schemes. Linear Algebra and its Applications, 478:08 30, 05. [6] G. Coutinho, C. Godsil, K. Guo, and H. Zhan. A new perspective on the average mixing matrix. Preprint, arxiv: , 07. [7] E. Farhi and S. Gutmann. Quantum computation and decision trees. Physical Review A, 58:95 98, 998. [8] C. Godsil and B. McKay. A new graph product and its spectrum. Bulletin of the Australian Mathematical Society, 8:-8, 978. [9] C. Godsil and G. Royle. Algebraic Graph Theory. Graduate Texts in Mathematics, Vol. 07, Springer-Verlag, New York, 00. [0] C.D. Godsil. Algebraic Combinatorics. Chapman & Hall, New York, 993. [] C.D. Godsil. State transfer on graphs. Discrete Mathematics, 3:9 47, 0. [] C.D. Godsil. Average mixing of continuous quantum walks. Journal of Combinatorial Theory, Series A, 0:649 66, 03. [3] C.D. Godsil, N. Mullin, and A. Roy. Uniform mixing and association schemes. Preprint, arxiv: , 03. [4] A. Kay. Perfect, efficient, state transfer and its application as a constructive tool. International Journal of Quantum Information, 8:64 676, 00. [5] W. Stein, et al. Sage Mathematics Software Version 6... The Sage Development Team, [6] L. Vinet and A. Zhedanov. How to construct spin chains with perfect state transfer. Physical Review A, 85:033, 0.
Note 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 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 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 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 informationWhen can perfect state transfer occur?
Electronic Journal of Linear Algebra Volume 23 Volume 23 (2012) Article 62 2012 When can perfect state transfer occur? Chris Godsil cgodsil@uwaterloo.ca 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 informationNo Laplacian Perfect State Transfer in Trees
No Laplacian Perfect State Transfer in Trees arxiv:1408.2935v1 [math.co] 13 Aug 2014 Gabriel Coutinho Henry Liu October 15, 2018 Abstract We consider a system of qubits coupled via nearest-neighbour interaction
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 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 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 informationLaplacian Integral Graphs with Maximum Degree 3
Laplacian Integral Graphs with Maximum Degree Steve Kirkland Department of Mathematics and Statistics University of Regina Regina, Saskatchewan, Canada S4S 0A kirkland@math.uregina.ca Submitted: Nov 5,
More informationA 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 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 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 informationState transfer in strongly regular graphs with an edge perturbation
State transfer in strongly regular graphs with an edge perturbation Chris Godsil, Krystal Guo, Mark Kempton, Gabor Lippner October 9, 2017 Abstract Quantum walks, an important tool in quantum computing,
More informationMa/CS 6b Class 23: Eigenvalues in Regular Graphs
Ma/CS 6b Class 3: Eigenvalues in Regular Graphs By Adam Sheffer Recall: The Spectrum of a Graph Consider a graph G = V, E and let A be the adjacency matrix of G. The eigenvalues of G are the eigenvalues
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 informationBounds for the Zero Forcing Number of Graphs with Large Girth
Theory and Applications of Graphs Volume 2 Issue 2 Article 1 2015 Bounds for the Zero Forcing Number of Graphs with Large Girth Randy Davila Rice University, rrd32@txstate.edu Franklin Kenter Rice University,
More informationA Simple Proof of Fiedler's Conjecture Concerning Orthogonal Matrices
University of Wyoming Wyoming Scholars Repository Mathematics Faculty Publications Mathematics 9-1-1997 A Simple Proof of Fiedler's Conjecture Concerning Orthogonal Matrices Bryan L. Shader University
More informationStrongly Regular Decompositions of the Complete Graph
Journal of Algebraic Combinatorics, 17, 181 201, 2003 c 2003 Kluwer Academic Publishers. Manufactured in The Netherlands. Strongly Regular Decompositions of the Complete Graph EDWIN R. VAN DAM Edwin.vanDam@uvt.nl
More informationTriply Regular Graphs
Triply Regular Graphs by Krystal J. Guo Simon Fraser University Burnaby, British Columbia, Canada, 2011 c Krystal J. Guo 2011 Abstract This project studies a regularity condition on graphs. A graph X
More informationNew feasibility conditions for directed strongly regular graphs
New feasibility conditions for directed strongly regular graphs Sylvia A. Hobart Jason Williford Department of Mathematics University of Wyoming Laramie, Wyoming, U.S.A sahobart@uwyo.edu, jwillif1@uwyo.edu
More informationPeriodicity & State Transfer Some Results Some Questions. Periodic Graphs. Chris Godsil. St John s, June 7, Chris Godsil Periodic Graphs
St John s, June 7, 2009 Outline 1 Periodicity & State Transfer 2 Some Results 3 Some Questions Unitary Operators Suppose X is a graph with adjacency matrix A. Definition We define the operator H X (t)
More informationAverage mixing of continuous quantum walks
Average mixing of continuous quantum walks Juergen Kritschgau Department of Mathematics Iowa State University Ames, IA 50011 jkritsch@iastate.edu April 7, 2017 Juergen Kritschgau (ISU) 2 of 17 This is
More informationLinear algebra and applications to graphs Part 1
Linear algebra and applications to graphs Part 1 Written up by Mikhail Belkin and Moon Duchin Instructor: Laszlo Babai June 17, 2001 1 Basic Linear Algebra Exercise 1.1 Let V and W be linear subspaces
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 informationEigenvectors and Reconstruction
Eigenvectors and Reconstruction Hongyu He Department of Mathematics Louisiana State University, Baton Rouge, USA hongyu@mathlsuedu Submitted: Jul 6, 2006; Accepted: Jun 14, 2007; Published: Jul 5, 2007
More informationA Questionable Distance-Regular Graph
A Questionable Distance-Regular Graph Rebecca Ross Abstract In this paper, we introduce distance-regular graphs and develop the intersection algebra for these graphs which is based upon its intersection
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 informationWhich Quantum Walk on Graphs?
Which Quantum Walk on Graphs? Christino Tamon Department of Computer Science Clarkson University August 13, 2015 Outline I Walks on graphs (random and quantum) I State transfer on graphs (motivation) I
More informationTopics in Graph Theory
Topics in Graph Theory September 4, 2018 1 Preliminaries A graph is a system G = (V, E) consisting of a set V of vertices and a set E (disjoint from V ) of edges, together with an incidence function End
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 informationMatching Polynomials of Graphs
Spectral Graph Theory Lecture 25 Matching Polynomials of Graphs Daniel A Spielman December 7, 2015 Disclaimer These notes are not necessarily an accurate representation of what happened in class The notes
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 informationMa/CS 6b Class 20: Spectral Graph Theory
Ma/CS 6b Class 20: Spectral Graph Theory By Adam Sheffer Eigenvalues and Eigenvectors A an n n matrix of real numbers. The eigenvalues of A are the numbers λ such that Ax = λx for some nonzero vector x
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 informationGraph coloring, perfect graphs
Lecture 5 (05.04.2013) Graph coloring, perfect graphs Scribe: Tomasz Kociumaka Lecturer: Marcin Pilipczuk 1 Introduction to graph coloring Definition 1. Let G be a simple undirected graph and k a positive
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 informationIntriguing sets of vertices of regular graphs
Intriguing sets of vertices of regular graphs Bart De Bruyn and Hiroshi Suzuki February 18, 2010 Abstract Intriguing and tight sets of vertices of point-line geometries have recently been studied in the
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 informationLecture 7: Positive Semidefinite Matrices
Lecture 7: Positive Semidefinite Matrices Rajat Mittal IIT Kanpur The main aim of this lecture note is to prepare your background for semidefinite programming. We have already seen some linear algebra.
More informationSIMPLICES AND SPECTRA OF GRAPHS
University of Ljubljana Institute of Mathematics, Physics and Mechanics Department of Mathematics Jadranska 9, 000 Ljubljana, Slovenia Preprint series, Vol. 47 (2009), 07 SIMPLICES AND SPECTRA OF GRAPHS
More informationSmith Normal Form and Acyclic Matrices
Smith Normal Form and Acyclic Matrices In-Jae Kim and Bryan L Shader Department of Mathematics University of Wyoming Laramie, WY 82071, USA July 30, 2006 Abstract An approach, based on the Smith Normal
More informationPeter J. Dukes. 22 August, 2012
22 August, 22 Graph decomposition Let G and H be graphs on m n vertices. A decompostion of G into copies of H is a collection {H i } of subgraphs of G such that each H i = H, and every edge of G belongs
More informationQuantum Walks on Strongly Regular Graphs
Quantum Walks on Strongly Regular Graphs by Krystal J. Guo A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Master of Mathematics in Combinatorics
More informationALGEBRAIC MATCHING THEORY. C. D. Godsil 1
ALGEBRAIC MATCHING THEORY C. D. Godsil 1 Department of Combinatorics and Optimization University of Waterloo Waterloo, Ontario Canada N2L 3G1 chris@bilby.uwaterloo.ca Submitted: July 6, 1994; Accepted:
More informationLINEAR ALGEBRA BOOT CAMP WEEK 1: THE BASICS
LINEAR ALGEBRA BOOT CAMP WEEK 1: THE BASICS Unless otherwise stated, all vector spaces in this worksheet are finite dimensional and the scalar field F has characteristic zero. The following are facts (in
More informationGraphs with Integral Spectrum
Graphs with Integral Spectrum Omran Ahmadi Department of Combinatorics & Optimization University of Waterloo Waterloo, Ontario, N2L 3G1, Canada oahmadid@math.uwaterloo.ca Noga Alon Department of Mathematics
More informationLocating-Total Dominating Sets in Twin-Free Graphs: a Conjecture
Locating-Total Dominating Sets in Twin-Free Graphs: a Conjecture Florent Foucaud Michael A. Henning Department of Pure and Applied Mathematics University of Johannesburg Auckland Park, 2006, South Africa
More 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 informationLecture Summaries for Linear Algebra M51A
These lecture summaries may also be viewed online by clicking the L icon at the top right of any lecture screen. Lecture Summaries for Linear Algebra M51A refers to the section in the textbook. Lecture
More informationarxiv: v1 [math.co] 20 Sep 2012
arxiv:1209.4628v1 [math.co] 20 Sep 2012 A graph minors characterization of signed graphs whose signed Colin de Verdière parameter ν is two Marina Arav, Frank J. Hall, Zhongshan Li, Hein van der Holst Department
More informationProperties of θ-super positive graphs
Properties of θ-super positive graphs Cheng Yeaw Ku Department of Mathematics, National University of Singapore, Singapore 117543 matkcy@nus.edu.sg Kok Bin Wong Institute of Mathematical Sciences, University
More informationRegular graphs with a small number of distinct eigenvalues
Regular graphs with a small number of distinct eigenvalues Tamara Koledin UNIVERZITET U BEOGRADU ELEKTROTEHNIČKI FAKULTET This is joint work with Zoran Stanić Bipartite regular graphs Bipartite regular
More 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 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 informationA linear algebraic view of partition regular matrices
A linear algebraic view of partition regular matrices Leslie Hogben Jillian McLeod June 7, 3 4 5 6 7 8 9 Abstract Rado showed that a rational matrix is partition regular over N if and only if it satisfies
More informationMa/CS 6b Class 20: Spectral Graph Theory
Ma/CS 6b Class 20: Spectral Graph Theory By Adam Sheffer Recall: Parity of a Permutation S n the set of permutations of 1,2,, n. A permutation σ S n is even if it can be written as a composition of an
More informationPROBLEMS ON LINEAR ALGEBRA
1 Basic Linear Algebra PROBLEMS ON LINEAR ALGEBRA 1. Let M n be the (2n + 1) (2n + 1) for which 0, i = j (M n ) ij = 1, i j 1,..., n (mod 2n + 1) 1, i j n + 1,..., 2n (mod 2n + 1). Find the rank of M n.
More information1 Last time: least-squares problems
MATH Linear algebra (Fall 07) Lecture Last time: least-squares problems Definition. If A is an m n matrix and b R m, then a least-squares solution to the linear system Ax = b is a vector x R n such that
More informationThe Local Spectra of Regular Line Graphs
The Local Spectra of Regular Line Graphs M. A. Fiol a, M. Mitjana b, a Departament de Matemàtica Aplicada IV Universitat Politècnica de Catalunya Barcelona, Spain b Departament de Matemàtica Aplicada I
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 informationAn algebraic proof of the Erdős-Ko-Rado theorem for intersecting families of perfect matchings
Also available at http://amc-journal.eu ISSN 855-3966 (printed edn.), ISSN 855-3974 (electronic edn.) ARS MATHEMATICA CONTEMPORANEA 2 (207) 205 27 An algebraic proof of the Erdős-Ko-Rado theorem for intersecting
More informationNear-domination in graphs
Near-domination in graphs Bruce Reed Researcher, Projet COATI, INRIA and Laboratoire I3S, CNRS France, and Visiting Researcher, IMPA, Brazil Alex Scott Mathematical Institute, University of Oxford, Oxford
More informationSpectra of Semidirect Products of Cyclic Groups
Spectra of Semidirect Products of Cyclic Groups Nathan Fox 1 University of Minnesota-Twin Cities Abstract The spectrum of a graph is the set of eigenvalues of its adjacency matrix A group, together with
More informationBulletin T.CXXII de l Académie Serbe des Sciences et des Arts Classe des Sciences mathématiques et naturelles Sciences mathématiques, No 26
Bulletin T.CXXII de l Académie Serbe des Sciences et des Arts - 001 Classe des Sciences mathématiques et naturelles Sciences mathématiques, No 6 SOME SPECTRAL PROPERTIES OF STARLIKE TREES M. LEPOVIĆ, I.
More 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 informationZERO FORCING PARAMETERS AND MINIMUM RANK PROBLEMS. March 2, 2010
ZERO FORCING PARAMETERS AND MINIMUM RANK PROBLEMS FRANCESCO BARIOLI, WAYNE BARRETT, SHAUN M. FALLAT, H. TRACY HALL, LESLIE HOGBEN, BRYAN SHADER, P. VAN DEN DRIESSCHE, AND HEIN VAN DER HOLST March 2, 2010
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 informationCentral Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J
Central Groupoids, Central Digraphs, and Zero-One Matrices A Satisfying A 2 = J Frank Curtis, John Drew, Chi-Kwong Li, and Daniel Pragel September 25, 2003 Abstract We study central groupoids, central
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 informationarxiv:quant-ph/ v1 22 Aug 2005
Conditions for separability in generalized Laplacian matrices and nonnegative matrices as density matrices arxiv:quant-ph/58163v1 22 Aug 25 Abstract Chai Wah Wu IBM Research Division, Thomas J. Watson
More informationLecture 5 January 16, 2013
UBC CPSC 536N: Sparse Approximations Winter 2013 Prof. Nick Harvey Lecture 5 January 16, 2013 Scribe: Samira Samadi 1 Combinatorial IPs 1.1 Mathematical programs { min c Linear Program (LP): T x s.t. a
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 informationAn Introduction to Algebraic Graph Theory
An Introduction to Algebraic Graph Theory Rob Beezer beezer@ups.edu Department of Mathematics and Computer Science University of Puget Sound Mathematics Department Seminar Pacific University October 9,
More informationALGEBRAIC COMBINATORICS. c1993 C. D. Godsil
ALGEBRAIC COMBINATORICS c1993 C. D. Godsil To Gillian Preface There are people who feel that a combinatorial result should be given a \purely combinatorial" proof, but I am not one of them. For me the
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 informationFORBIDDEN MINORS FOR THE CLASS OF GRAPHS G WITH ξ(g) 2. July 25, 2006
FORBIDDEN MINORS FOR THE CLASS OF GRAPHS G WITH ξ(g) 2 LESLIE HOGBEN AND HEIN VAN DER HOLST July 25, 2006 Abstract. For a given simple graph G, S(G) is defined to be the set of real symmetric matrices
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 information(a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? Solution: dim N(A) 1, since rank(a) 3. Ax =
. (5 points) (a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? dim N(A), since rank(a) 3. (b) If we also know that Ax = has no solution, what do we know about the rank of A? C(A)
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 informationComplex Hadamard matrices and 3-class association schemes
Complex Hadamard matrices and 3-class association schemes Akihiro Munemasa 1 (joint work with Takuya Ikuta) 1 Graduate School of Information Sciences Tohoku University June 27, 2014 Algebraic Combinatorics:
More informationThe Minimum Rank, Inverse Inertia, and Inverse Eigenvalue Problems for Graphs. Mark C. Kempton
The Minimum Rank, Inverse Inertia, and Inverse Eigenvalue Problems for Graphs Mark C. Kempton A thesis submitted to the faculty of Brigham Young University in partial fulfillment of the requirements for
More informationAn upper bound for the minimum rank of a graph
An upper bound for the minimum rank of a graph Avi Berman Shmuel Friedland Leslie Hogben Uriel G. Rothblum Bryan Shader April 3, 2008 Abstract For a graph G of order n, the minimum rank of G is defined
More informationarxiv: v4 [math.co] 12 Feb 2017
arxiv:1511.03511v4 [math.co] 12 Feb 2017 On the signed graphs with two distinct eigenvalues F. Ramezani 1 Department of Mathematics, K.N.Toosi University of Technology, Tehran, Iran P.O. Box 16315-1618
More informationThe edge-density for K 2,t minors
The edge-density for K,t minors Maria Chudnovsky 1 Columbia University, New York, NY 1007 Bruce Reed McGill University, Montreal, QC Paul Seymour Princeton University, Princeton, NJ 08544 December 5 007;
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 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 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 informationLecture 13 Spectral Graph Algorithms
COMS 995-3: Advanced Algorithms March 6, 7 Lecture 3 Spectral Graph Algorithms Instructor: Alex Andoni Scribe: Srikar Varadaraj Introduction Today s topics: Finish proof from last lecture Example of random
More informationDistance-regular graphs where the distance-d graph has fewer distinct eigenvalues
NOTICE: this is the author s version of a work that was accepted for publication in . Changes resulting from the publishing process, such as peer review, editing, corrections,
More informationDISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS
DISTINGUISHING PARTITIONS AND ASYMMETRIC UNIFORM HYPERGRAPHS M. N. ELLINGHAM AND JUSTIN Z. SCHROEDER In memory of Mike Albertson. Abstract. A distinguishing partition for an action of a group Γ on a set
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 informationSVD, Power method, and Planted Graph problems (+ eigenvalues of random matrices)
Chapter 14 SVD, Power method, and Planted Graph problems (+ eigenvalues of random matrices) Today we continue the topic of low-dimensional approximation to datasets and matrices. Last time we saw the singular
More informationMatrix functions that preserve the strong Perron- Frobenius property
Electronic Journal of Linear Algebra Volume 30 Volume 30 (2015) Article 18 2015 Matrix functions that preserve the strong Perron- Frobenius property Pietro Paparella University of Washington, pietrop@uw.edu
More informationUniform Star-factors of Graphs with Girth Three
Uniform Star-factors of Graphs with Girth Three Yunjian Wu 1 and Qinglin Yu 1,2 1 Center for Combinatorics, LPMC Nankai University, Tianjin, 300071, China 2 Department of Mathematics and Statistics Thompson
More informationA New Spectral Technique Using Normalized Adjacency Matrices for Graph Matching 1
CHAPTER-3 A New Spectral Technique Using Normalized Adjacency Matrices for Graph Matching Graph matching problem has found many applications in areas as diverse as chemical structure analysis, pattern
More informationMathematical Programs Linear Program (LP)
Mathematical Programs Linear Program (LP) Integer Program (IP) Can be efficiently solved e.g., by Ellipsoid Method Cannot be efficiently solved Cannot be efficiently solved assuming P NP Combinatorial
More informationHadamard matrices and strongly regular graphs with the 3-e.c. adjacency property
Hadamard matrices and strongly regular graphs with the 3-e.c. adjacency property Anthony Bonato Department of Mathematics, Wilfrid Laurier University, Waterloo, Ontario, Canada, N2L 3C5 abonato@wlu.ca
More information235 Final exam review questions
5 Final exam review questions Paul Hacking December 4, 0 () Let A be an n n matrix and T : R n R n, T (x) = Ax the linear transformation with matrix A. What does it mean to say that a vector v R n is an
More information