The Matrix-Tree Theorem
|
|
- Gilbert Hill
- 6 years ago
- Views:
Transcription
1 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 We define preliminary definitions and give a brief list of facts from linear algebra without proof. Definition 1.1. For k Z 0, denote by [k] the set {1, 2,..., k} ([0] := ). Definition 1.2. Let X be a set, then denote by ( ) X k the set of k-element subsets of X. Denote by ( ( ) X k ) the set of k-element multisets (sets with repeated elements) of X. Example 1.3. Let X = {a, b, c, d}. Then {a, c}, {b, c} ( ) ( X 2, {a, a} / X ) 2, and {a, b, d}, {a, a, b}, {c, c, c} ( ( ) X 3 ) Proposition 1.4. A, a n n matrix, that is real symmetric has a orthonormal eigenbasis (u 1, u 2,..., u n ), u i R n where u t i u j = δ ij (Kronecker delta). Moreover, if U = [u 1... u n ] is a n n matrix whose columns are u 1,..., u n, then U 1 = U t and U t AU is diagonal. Definition 1.5. Let A be a m n matrix with m n, and S ( [n] m). Denote by A[S] the m m submatrix of A formed by taking columns of A indexed by S. Likewise, if B is a n m matrix with m n, then denote by B[S] the m m submatrix of B formed by taking rows of B indexed by S. Observation 1.6. Note that (A[S]) t = A t [S] 1
2 Example 1.7. If Then A = [ ] , B = A[S] = [ ] 2 7, B[S] = 4 0 ( [4], S = {2, 3} 2 [ 2 ] Theorem 1.8. (Cauchy-Binet Formula) Let A, B be m n, n m matrices, respectively, and m n. Then det(ab) = det(a[s]) det(b[s]) S ( [n] m) Proposition 1.9. Let A be an n n matrix such that the sum of entries in each row and column is zero, and A 0 be the matrix obtained by removing the last row and column of A. Then the coefficient of x in det(a xi) is equal to n det(a 0 ). ) 2 Walks on Graphs We present elementary graph theory on walks on graphs. Definition 2.1. A (finite) graph G = (V (G), E(G)) consists of a vertex set V (G) = {v 1,..., v p } and an edge set E(G) = {e 1,..., e q } with a function ϕ : E ( ( V 2) ). Moreover, for e E(G) and v, v V (G), if ϕ(e) = {v, v } then e connects or is incident to v and v ; if e that connects v, v, then v and v are adjacent; if ϕ(e) = {v, v} then e is called a loop Example 2.2. v2 e1 e2 e3 v3 v1 is a graph G = (V = {v1, v2, v3}, E = {e1, e2, e3}) where ϕ(e1) = ϕ(e2) = {v2, v3}, ϕ(e3) = {v1, v2} 2
3 NOTE: For the remainder of the article we will say our graph G has p many vertices and q many edges unless stated otherwise. Definition 2.3. The adjacency matrix of graph G, denoted A(G) (or just A if G is clear), is the p p matrix where A ij =(number of edges incident to v i and v j ) Example 2.4. In the Example 2.2, we have A = Observation 2.5. Let G be a graph. Then we can easily see that A(G) is (real) symmetric, and the trace is the number of loops in G. Definition 2.6. A walk of length l on a graph G from vertex u to vertex v is a sequence v 1, e 2, v 2, e 2,..., v l, e l, v l+1 such that v i s are in V (G), v 1 = u, v l+1 = v, and e i s are in E(G) such that e i connects v i and v i+1. Now we have our first elementary result: Theorem 2.7. Let G be a graph, A = A(G). Then (A l ) ij =(number of walks from v i to v j for all l N) Proof) We induct on l. l = 1 case is trivial. (A l ) ij = p k=1 A ik(a l 1 ) kj and A ik is the number of walks of length 1 from v i to v k and by induction (A l 1 ) kj is the number of walks of length l 1 from v k to v i, so summing over k we have our desired result. We also know that A(G) is real symmetric, so let λ 1,..., λ p be the eigenvalues and u 1,..., u p be the orthonormal basis that corresponds to them respectively, and let U be the orthogonal matrix formed by u i s as the columns. Then we have the following refinement of the previous theorem in more algebraic terms: Corollary 2.8. Let u ij be (i, j)th coordinate of U. Then (A l ) ij = p u ik u jk λ l k k=1 and defining closed walk as a walk that starts and ends at the same vertex, we have (number of closed walks of length l) = Tr(A l ) = λ l λ l p 3
4 Proof) Let D = Diag(λ 1,..., λ p ). Then both statements follow immediately from U D l U t = A l (noting that Tr(AB) = Tr(BA)). We give an application of this corollary to completely graph as an example: Definition 2.9. A complete graph K p is a graph G with p vertices such that there exists exactly one edge connecting v i to v j for all 1 i < j p. Example Below are K 3, K 4, and K 5 : Proposition Let K p be a complete graph, A = A(K p ). Then (A l ) ii = 1 p ((p 1) l + (p 1)( 1) l) Proof) By symmetry, note that (A l ) ii s are equal for all i = 1,..., p. So, we show Tr(A l ) = (p 1) l + (p 1)( 1) l. Let J be a p p matrix with all entries equal to 1. It is easy to check that J has eigenvalues 0 (with multiplicity p 1) and p (with multiplicity 1), so J I has eigenvalues -1 (with multiplicity p 1) and p 1 (with multiplicity 1). And since A(K p ) is exactly J I, applying our previous corollary we have our desired result. 3 The Matrix-Tree Theorem For this section, we assume that G has no loops because they are completely irrelevant to our discussion. We also assume G is connected, that is, there exists a walk between any two vertices of G. 4
5 Definition 3.1. A cycle is a closed walk with no repeated vertices or edges except for the first and last vertex. A tree is a (connected) graph that has no cycles. Observation 3.2. It s useful to observe that the following are equivalent: (i) G is a tree, (ii) G is connected and has p 1 edges, (iii) G has no cycles and has p 1 edges. Definition 3.3. Let G be a graph. A subgraph G of G is a graph with V (G ) V (G), E(G ) E(G). A subgraph G is a spanning subgraph if V (G ) = V (G). A subgraph G is a spanning tree if it is a spanning subgraph that is a tree. Definition 3.4. Let G be a graph. The complexity of G, denoted κ(g), is the number of spanning trees of G. Example 3.5. Going back to K 3, K 4, and K 5 : It is not hard to count combinatorially and confirm that κ(k 3 ) = 3, κ(k 4 ) = 16, κ(k 5 ) = 125. For example, for K 5, the three types of trees with 5 vertices are: v1 v2 v3 v4 v5 v1 v2 v3 v5 v4 v1 v5 v3 v2 v4 5
6 And there are 5!/2 many spanning trees of K 5 of the first type, ( 5 2) (3)(2) many of the second type, and 5 of the last type. Summing up we have 125. From this we may guess that the formula for κ(k p ) = p p 2. The remainder of our discussion in this section will culminate in proving this result. Recall our notation that a generic graph G has vertices {v 1,..., v p } and edges {e 1,..., e q }. Definition 3.6. Let G be a graph. We can give G an orientation. That is, for ϕ(e) = {u, v}, choose one of two ordered pairs (u, v), (v, u). Say we chose (u, v), then we call u the initial vertex and v the final vertex of e, and e is directed from u to v. (Intuitively, this is putting an arrow on e pointing from u to v). We first define two more algebraic tools (matrices) that will aid us: Definition 3.7. Let G be a graph with an orientation. The incidence matrix M(G) = M is the p q matrix defined by: 1 if the edge e j has initial vertex v i M ij = 1 if the edge e j has final vertex v i 0 otherwise Definition 3.8. Let G be a graph with an orientation and A = A(G). The Laplacian matrix L(G) = L is the p p matrix defined by: { Aij if i j M ij = deg(v i ) if i = j Example 3.9. Below is an oriented graph v2 e1 e2 v3 e3 e5 v1 e4 v4 6
7 with: M = , L = Observation In M, each column entries sum to zero, so rows of M sum to zero vector, hence rank(m) < p. In L, entries in each column or row sum to zero, and L is symmetric. Lastly, if G is regular of degree d, that is deg(v i ) = d for all v i V (G), then L = di A(G). We can now state our main theorem: Theorem (Matrix-Tree Theorem) Let G be (finite connected) graph (without loops), and let L = L(G). Denote by L 0 the matrix obtained by removing the last row and column of L. Then Our proof requires two lemmas: det(l 0 ) = κ(g) Lemma Let G be a graph, give G any orientation, and let L = L(G), M = (G). Then L = MM t. Proof) We have M ij = q M ik M jk k=1 If i j, for each k, if e k connects v i and v j exactly one of M ik, M jk is 1, and the other 1. If i = j, either M ik, M jk are both zero (if e k is not incident to v i ) and both 1 or 1 if e k is incident to v i. Definition Let G be a graph, M = M(G), and M 0 := (p 1) q matrix obtained by removing the last row of M. For S ( [q] p 1), we define S(E) to be a subset of edges indexed by S (i.e. S(E) = {e i } i S {e 1,..., e q }), and define p 1 p 1 matrix M 0 [S] as in definition 1.5. Moreover, by graph formed by S(E) (which we also denote as S(E)), we mean graph with edges in S(E) and vertices incident to an edge in S(E). Lemma If S(E) forms a spanning tree, then det M 0 [S] = ±1, if S(E) does not, then det M 0 [S] = 0. 7
8 Proof) If S(E) does not form a spanning tree, since we have p 1 edges there must be a subset R of S such that R(E) forms a cycle, so let this cycle be f 1,..., f j (a walk without the vertices written down). Then multiplying 1 if necessary, the columns of M corresponding to f i s sum to zero, hence det M 0 [S] = 0. Now suppose S(E) forms a spanning tree. Let e be an edge of S(E) incident to v p, then the column of M 0 [S] corresponding to e contains exactly one nonzero entry which is ±1. So, If M 0 is the p 2 p 2 matrix obtained by removing the two and column containing the nonzero entry of column e, by determinant expansion det M 0 [S] = ± det M 0. Now consider G a graph (in fact a tree) obtained by contracting the edge e to a single vertex (so v p is now identified with the vertex e connected v p to.) M(G ) p 1 p 2 matrix formed by removing the column e, and so M 0 is the matrix formed by removing the bottom row of M(G ). And thus by induction det M 0 = ±1, and this completes our proof. Proof of the Matrix-Tree Theorem Since L = MM, we have L 0 = M 0 M0 t. By Cauchy-Binet formula, we have det L 0 = (det M 0 [S])(det M0[S]) t = (det(m 0 [S])) 2 ( (A[S]) t = A t [S]) S S ( [q] p 1) and (det(m 0 [S])) 2 is 1 if S(E) forms a spanning tree and 0 otherwise, and a tree with p vertices has p 1 edges, so summing over S ( [q] p 1), RHS exactly counts the number of spanning trees of G. Corollary Let G be a (finite connected) graph (without loops) with p vertices, and let λ 1,..., λ p be the eigenvalues of L(G) with λ p = 0, then κ(g) = 1 p λ 1λ 2 λ p 1 Proof) First we note that λ p = 0 is possible since each rows (and columns) sum to zero in L(G) ( Observation 3.10). And det(l xi) = (λ 1 x)(λ 2 x) (λ p 1 x)( x). So by Proposition 1.9 we have λ 1... λ p 1 ( coeff. of x) equals p det(l 0 ), and the corollary thus follows. 8
9 Corollary Let G be a regular graph of degree d, and let the eigenvalues of A(G) be λ 1,..., λ p with λ p = d. Then, κ(g) = 1 p (d λ 1)(d λ 2 ) (d λ p 1 ) Proof) Follows immediately from L = di A(G) and the previous corollary. Now, as we promised, we have: Theorem κ(k p ) = p p 2 Proof) K p is regular of degree d, and A(K p ) has eigenvalues 1 with multiplicity p 1 and p 1 with multiplicity 1. So from our Corollary 3.16 we have κ(k p ) = 1 p ((p 1) ( 1))p 1 = p p 2, as desired. 4 References Stanley, Richard P. Topics in Algebraic Combinatorics. Version 1 Feb rstan/algcomb/algcomb.pdf 9
Lecture 1 and 2: Random Spanning Trees
Recent Advances in Approximation Algorithms Spring 2015 Lecture 1 and 2: Random Spanning Trees Lecturer: Shayan Oveis Gharan March 31st Disclaimer: These notes have not been subjected to the usual scrutiny
More information1 Counting spanning trees: A determinantal formula
Math 374 Matrix Tree Theorem Counting spanning trees: A determinantal formula Recall that a spanning tree of a graph G is a subgraph T so that T is a tree and V (G) = V (T ) Question How many distinct
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 information18.312: Algebraic Combinatorics Lionel Levine. Lecture 19
832: Algebraic Combinatorics Lionel Levine Lecture date: April 2, 20 Lecture 9 Notes by: David Witmer Matrix-Tree Theorem Undirected Graphs Let G = (V, E) be a connected, undirected graph with n vertices,
More informationMath 240 Calculus III
The Calculus III Summer 2015, Session II Wednesday, July 8, 2015 Agenda 1. of the determinant 2. determinants 3. of determinants What is the determinant? Yesterday: Ax = b has a unique solution when A
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 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 informationSmith Normal Form and Combinatorics
Smith Normal Form and Combinatorics p. 1 Smith Normal Form and Combinatorics Richard P. Stanley Smith Normal Form and Combinatorics p. 2 Smith normal form A: n n matrix over commutative ring R (with 1)
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 informationSpectral Graph Theory and You: Matrix Tree Theorem and Centrality Metrics
Spectral Graph Theory and You: and Centrality Metrics Jonathan Gootenberg March 11, 2013 1 / 19 Outline of Topics 1 Motivation Basics of Spectral Graph Theory Understanding the characteristic polynomial
More informationMATH Topics in Applied Mathematics Lecture 12: Evaluation of determinants. Cross product.
MATH 311-504 Topics in Applied Mathematics Lecture 12: Evaluation of determinants. Cross product. Determinant is a scalar assigned to each square matrix. Notation. The determinant of a matrix A = (a ij
More informationChapter 2:Determinants. Section 2.1: Determinants by cofactor expansion
Chapter 2:Determinants Section 2.1: Determinants by cofactor expansion [ ] a b Recall: The 2 2 matrix is invertible if ad bc 0. The c d ([ ]) a b function f = ad bc is called the determinant and it associates
More informationA = , A 32 = n ( 1) i +j a i j det(a i j). (1) j=1
Lecture Notes: Determinant of a Square Matrix Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong taoyf@cse.cuhk.edu.hk 1 Determinant Definition Let A [a ij ] be an
More informationSmith Normal Form and Combinatorics
Smith Normal Form and Combinatorics Richard P. Stanley June 8, 2017 Smith normal form A: n n matrix over commutative ring R (with 1) Suppose there exist P,Q GL(n,R) such that PAQ := B = diag(d 1,d 1 d
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 informationMA 1B ANALYTIC - HOMEWORK SET 7 SOLUTIONS
MA 1B ANALYTIC - HOMEWORK SET 7 SOLUTIONS 1. (7 pts)[apostol IV.8., 13, 14] (.) Let A be an n n matrix with characteristic polynomial f(λ). Prove (by induction) that the coefficient of λ n 1 in f(λ) is
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 information7 Matrix Operations. 7.0 Matrix Multiplication + 3 = 3 = 4
7 Matrix Operations Copyright 017, Gregory G. Smith 9 October 017 The product of two matrices is a sophisticated operations with a wide range of applications. In this chapter, we defined this binary operation,
More informationLinear Algebra M1 - FIB. Contents: 5. Matrices, systems of linear equations and determinants 6. Vector space 7. Linear maps 8.
Linear Algebra M1 - FIB Contents: 5 Matrices, systems of linear equations and determinants 6 Vector space 7 Linear maps 8 Diagonalization Anna de Mier Montserrat Maureso Dept Matemàtica Aplicada II Translation:
More informationEvaluating Determinants by Row Reduction
Evaluating Determinants by Row Reduction MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Objectives Reduce a matrix to row echelon form and evaluate its determinant.
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 informationCS 246 Review of Linear Algebra 01/17/19
1 Linear algebra In this section we will discuss vectors and matrices. We denote the (i, j)th entry of a matrix A as A ij, and the ith entry of a vector as v i. 1.1 Vectors and vector operations A vector
More informationMath Camp Lecture 4: Linear Algebra. Xiao Yu Wang. Aug 2010 MIT. Xiao Yu Wang (MIT) Math Camp /10 1 / 88
Math Camp 2010 Lecture 4: Linear Algebra Xiao Yu Wang MIT Aug 2010 Xiao Yu Wang (MIT) Math Camp 2010 08/10 1 / 88 Linear Algebra Game Plan Vector Spaces Linear Transformations and Matrices Determinant
More informationThe Determinant: a Means to Calculate Volume
The Determinant: a Means to Calculate Volume Bo Peng August 16, 2007 Abstract This paper gives a definition of the determinant and lists many of its well-known properties Volumes of parallelepipeds are
More informationStatistical Mechanics and Combinatorics : Lecture II
Statistical Mechanics and Combinatorics : Lecture II Kircho s matrix-tree theorem Deinition (Spanning tree) A subgraph T o a graph G(V, E) is a spanning tree i it is a tree that contains every vertex in
More informationOn minors of the compound matrix of a Laplacian
On minors of the compound matrix of a Laplacian R. B. Bapat 1 Indian Statistical Institute New Delhi, 110016, India e-mail: rbb@isid.ac.in August 28, 2013 Abstract: Let L be an n n matrix with zero row
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 informationReview of Linear Algebra
Review of Linear Algebra Definitions An m n (read "m by n") matrix, is a rectangular array of entries, where m is the number of rows and n the number of columns. 2 Definitions (Con t) A is square if m=
More informationLecture 23: Trace and determinants! (1) (Final lecture)
Lecture 23: Trace and determinants! (1) (Final lecture) Travis Schedler Thurs, Dec 9, 2010 (version: Monday, Dec 13, 3:52 PM) Goals (2) Recall χ T (x) = (x λ 1 ) (x λ n ) = x n tr(t )x n 1 + +( 1) n det(t
More informationDeterminants by Cofactor Expansion (III)
Determinants by Cofactor Expansion (III) Comment: (Reminder) If A is an n n matrix, then the determinant of A can be computed as a cofactor expansion along the jth column det(a) = a1j C1j + a2j C2j +...
More informationMath Linear Algebra Final Exam Review Sheet
Math 15-1 Linear Algebra Final Exam Review Sheet Vector Operations Vector addition is a component-wise operation. Two vectors v and w may be added together as long as they contain the same number n of
More informationLinear Algebra II. Ulrike Tillmann. January 4, 2018
Linear Algebra II Ulrike Tillmann January 4, 208 This course is a continuation of Linear Algebra I and will foreshadow much of what will be discussed in more detail in the Linear Algebra course in Part
More informationQuestion: Given an n x n matrix A, how do we find its eigenvalues? Idea: Suppose c is an eigenvalue of A, then what is the determinant of A-cI?
Section 5. The Characteristic Polynomial Question: Given an n x n matrix A, how do we find its eigenvalues? Idea: Suppose c is an eigenvalue of A, then what is the determinant of A-cI? Property The eigenvalues
More information4. Determinants.
4. Determinants 4.1. Determinants; Cofactor Expansion Determinants of 2 2 and 3 3 Matrices 2 2 determinant 4.1. Determinants; Cofactor Expansion Determinants of 2 2 and 3 3 Matrices 3 3 determinant 4.1.
More information1.10 Matrix Representation of Graphs
42 Basic Concepts of Graphs 1.10 Matrix Representation of Graphs Definitions: In this section, we introduce two kinds of matrix representations of a graph, that is, the adjacency matrix and incidence matrix
More informationMath 443 Differential Geometry Spring Handout 3: Bilinear and Quadratic Forms This handout should be read just before Chapter 4 of the textbook.
Math 443 Differential Geometry Spring 2013 Handout 3: Bilinear and Quadratic Forms This handout should be read just before Chapter 4 of the textbook. Endomorphisms of a Vector Space This handout discusses
More information2. Every linear system with the same number of equations as unknowns has a unique solution.
1. For matrices A, B, C, A + B = A + C if and only if A = B. 2. Every linear system with the same number of equations as unknowns has a unique solution. 3. Every linear system with the same number of equations
More information2.1 Laplacian Variants
-3 MS&E 337: Spectral Graph heory and Algorithmic Applications Spring 2015 Lecturer: Prof. Amin Saberi Lecture 2-3: 4/7/2015 Scribe: Simon Anastasiadis and Nolan Skochdopole Disclaimer: hese notes have
More informationLecture 18. Ramanujan Graphs continued
Stanford University Winter 218 Math 233A: Non-constructive methods in combinatorics Instructor: Jan Vondrák Lecture date: March 8, 218 Original scribe: László Miklós Lovász Lecture 18 Ramanujan Graphs
More informationProperties of the Determinant Function
Properties of the Determinant Function MATH 322, Linear Algebra I J. Robert Buchanan Department of Mathematics Spring 2015 Overview Today s discussion will illuminate some of the properties of the determinant:
More informationMATH 320: PRACTICE PROBLEMS FOR THE FINAL AND SOLUTIONS
MATH 320: PRACTICE PROBLEMS FOR THE FINAL AND SOLUTIONS There will be eight problems on the final. The following are sample problems. Problem 1. Let F be the vector space of all real valued functions on
More informationRefined Inertia of Matrix Patterns
Electronic Journal of Linear Algebra Volume 32 Volume 32 (2017) Article 24 2017 Refined Inertia of Matrix Patterns Kevin N. Vander Meulen Redeemer University College, kvanderm@redeemer.ca Jonathan Earl
More informationThe 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 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 informationEnergy of Graphs. Sivaram K. Narayan Central Michigan University. Presented at CMU on October 10, 2015
Energy of Graphs Sivaram K. Narayan Central Michigan University Presented at CMU on October 10, 2015 1 / 32 Graphs We will consider simple graphs (no loops, no multiple edges). Let V = {v 1, v 2,..., v
More 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 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 informationLinear Systems and Matrices
Department of Mathematics The Chinese University of Hong Kong 1 System of m linear equations in n unknowns (linear system) a 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.......
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 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 informationReview of linear algebra
Review of linear algebra 1 Vectors and matrices We will just touch very briefly on certain aspects of linear algebra, most of which should be familiar. Recall that we deal with vectors, i.e. elements of
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 informationGlossary of Linear Algebra Terms. Prepared by Vince Zaccone For Campus Learning Assistance Services at UCSB
Glossary of Linear Algebra Terms Basis (for a subspace) A linearly independent set of vectors that spans the space Basic Variable A variable in a linear system that corresponds to a pivot column in the
More informationTopic 15 Notes Jeremy Orloff
Topic 5 Notes Jeremy Orloff 5 Transpose, Inverse, Determinant 5. Goals. Know the definition and be able to compute the inverse of any square matrix using row operations. 2. Know the properties of inverses.
More informationSpectral radius, symmetric and positive matrices
Spectral radius, symmetric and positive matrices Zdeněk Dvořák April 28, 2016 1 Spectral radius Definition 1. The spectral radius of a square matrix A is ρ(a) = max{ λ : λ is an eigenvalue of A}. For an
More informationDeterminants Chapter 3 of Lay
Determinants Chapter of Lay Dr. Doreen De Leon Math 152, Fall 201 1 Introduction to Determinants Section.1 of Lay Given a square matrix A = [a ij, the determinant of A is denoted by det A or a 11 a 1j
More informationA NEW INTERPRETATION OF THE MATRIX TREE THEOREM USING WEAK WALK CONTRIBUTORS AND CIRCLE ACTIVATION HONORS THESIS
A NEW INTERPRETATION OF THE MATRIX TREE THEOREM USING WEAK WALK CONTRIBUTORS AND CIRCLE ACTIVATION HONORS THESIS Presented to the Honors College of Texas State University in Partial Fulfillment of the
More informationLinear Algebra: Lecture notes from Kolman and Hill 9th edition.
Linear Algebra: Lecture notes from Kolman and Hill 9th edition Taylan Şengül March 20, 2019 Please let me know of any mistakes in these notes Contents Week 1 1 11 Systems of Linear Equations 1 12 Matrices
More informationdet(ka) = k n det A.
Properties of determinants Theorem. If A is n n, then for any k, det(ka) = k n det A. Multiplying one row of A by k multiplies the determinant by k. But ka has every row multiplied by k, so the determinant
More informationCombinatorial and physical content of Kirchhoff polynomials
Combinatorial and physical content of Kirchhoff polynomials Karen Yeats May 19, 2009 Spanning trees Let G be a connected graph, potentially with multiple edges and loops in the sense of a graph theorist.
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 informationDiagonal Entry Restrictions in Minimum Rank Matrices, and the Inverse Inertia and Eigenvalue Problems for Graphs
Brigham Young University BYU ScholarsArchive All Theses and Dissertations 2012-06-11 Diagonal Entry Restrictions in Minimum Rank Matrices, and the Inverse Inertia and Eigenvalue Problems for Graphs Curtis
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 informationMathematical Methods wk 2: Linear Operators
John Magorrian, magog@thphysoxacuk These are work-in-progress notes for the second-year course on mathematical methods The most up-to-date version is available from http://www-thphysphysicsoxacuk/people/johnmagorrian/mm
More informationAn Algorithmist s Toolkit September 10, Lecture 1
18.409 An Algorithmist s Toolkit September 10, 2009 Lecture 1 Lecturer: Jonathan Kelner Scribe: Jesse Geneson (2009) 1 Overview The class s goals, requirements, and policies were introduced, and topics
More informationProperties of Ramanujan Graphs
Properties of Ramanujan Graphs Andrew Droll 1, 1 Department of Mathematics and Statistics, Jeffery Hall, Queen s University Kingston, Ontario, Canada Student Number: 5638101 Defense: 27 August, 2008, Wed.
More informationARTICLE IN PRESS European Journal of Combinatorics ( )
European Journal of Combinatorics ( ) Contents lists available at ScienceDirect European Journal of Combinatorics journal homepage: www.elsevier.com/locate/ejc Proof of a conjecture concerning the direct
More informationMATH 240 Spring, Chapter 1: Linear Equations and Matrices
MATH 240 Spring, 2006 Chapter Summaries for Kolman / Hill, Elementary Linear Algebra, 8th Ed. Sections 1.1 1.6, 2.1 2.2, 3.2 3.8, 4.3 4.5, 5.1 5.3, 5.5, 6.1 6.5, 7.1 7.2, 7.4 DEFINITIONS Chapter 1: Linear
More informationj=1 u 1jv 1j. 1/ 2 Lemma 1. An orthogonal set of vectors must be linearly independent.
Lecture Notes: Orthogonal and Symmetric Matrices Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong taoyf@cse.cuhk.edu.hk Orthogonal Matrix Definition. Let u = [u
More informationAn Algorithmist s Toolkit September 15, Lecture 2
18.409 An Algorithmist s Toolkit September 15, 007 Lecture Lecturer: Jonathan Kelner Scribe: Mergen Nachin 009 1 Administrative Details Signup online for scribing. Review of Lecture 1 All of the following
More informationLinear Algebra Formulas. Ben Lee
Linear Algebra Formulas Ben Lee January 27, 2016 Definitions and Terms Diagonal: Diagonal of matrix A is a collection of entries A ij where i = j. Diagonal Matrix: A matrix (usually square), where entries
More informationDS-GA 1002 Lecture notes 0 Fall Linear Algebra. These notes provide a review of basic concepts in linear algebra.
DS-GA 1002 Lecture notes 0 Fall 2016 Linear Algebra These notes provide a review of basic concepts in linear algebra. 1 Vector spaces You are no doubt familiar with vectors in R 2 or R 3, i.e. [ ] 1.1
More informationMath 18, Linear Algebra, Lecture C00, Spring 2017 Review and Practice Problems for Final Exam
Math 8, Linear Algebra, Lecture C, Spring 7 Review and Practice Problems for Final Exam. The augmentedmatrix of a linear system has been transformed by row operations into 5 4 8. Determine if the system
More informationDeterminants - Uniqueness and Properties
Determinants - Uniqueness and Properties 2-2-2008 In order to show that there s only one determinant function on M(n, R), I m going to derive another formula for the determinant It involves permutations
More informationAlgebraic Methods in Combinatorics
Algebraic Methods in Combinatorics Po-Shen Loh 27 June 2008 1 Warm-up 1. (A result of Bourbaki on finite geometries, from Răzvan) Let X be a finite set, and let F be a family of distinct proper subsets
More informationMath 443/543 Graph Theory Notes 5: Graphs as matrices, spectral graph theory, and PageRank
Math 443/543 Graph Theory Notes 5: Graphs as matrices, spectral graph theory, and PageRank David Glickenstein November 3, 4 Representing graphs as matrices It will sometimes be useful to represent graphs
More informationDETERMINANTS IN THE KRONECKER PRODUCT OF MATRICES: THE INCIDENCE MATRIX OF A COMPLETE GRAPH
DETERMINANTS IN THE KRONECKER PRODUCT OF MATRICES: THE INCIDENCE MATRIX OF A COMPLETE GRAPH CHRISTOPHER R.H. HANUSA AND THOMAS ZASLAVSKY Abstract. We investigate the least common multiple of all subdeterminants,
More informationAlgorithms to Compute Bases and the Rank of a Matrix
Algorithms to Compute Bases and the Rank of a Matrix Subspaces associated to a matrix Suppose that A is an m n matrix The row space of A is the subspace of R n spanned by the rows of A The column space
More informationReview problems for MA 54, Fall 2004.
Review problems for MA 54, Fall 2004. Below are the review problems for the final. They are mostly homework problems, or very similar. If you are comfortable doing these problems, you should be fine on
More informationGaussian Elimination and Back Substitution
Jim Lambers MAT 610 Summer Session 2009-10 Lecture 4 Notes These notes correspond to Sections 31 and 32 in the text Gaussian Elimination and Back Substitution The basic idea behind methods for solving
More informationIMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET
IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET This is a (not quite comprehensive) list of definitions and theorems given in Math 1553. Pay particular attention to the ones in red. Study Tip For each
More informationAverage Mixing Matrix of Trees
Electronic Journal of Linear Algebra Volume 34 Volume 34 08 Article 9 08 Average Mixing Matrix of Trees Chris Godsil University of Waterloo, cgodsil@uwaterloo.ca Krystal Guo Université libre de Bruxelles,
More informationSystem of Linear Equations
CHAPTER 2 System of Linear Equations. Introduction Study of a linear system of equations is classical. First let s consider a system having only one equation: 2x+3y +4z = 5 (2.) Indeterminates x,y,z are
More informationDeterminants. Samy Tindel. Purdue University. Differential equations and linear algebra - MA 262
Determinants Samy Tindel Purdue University Differential equations and linear algebra - MA 262 Taken from Differential equations and linear algebra by Goode and Annin Samy T. Determinants Differential equations
More informationExamples True or false: 3. Let A be a 3 3 matrix. Then there is a pattern in A with precisely 4 inversions.
The exam will cover Sections 6.-6.2 and 7.-7.4: True/False 30% Definitions 0% Computational 60% Skip Minors and Laplace Expansion in Section 6.2 and p. 304 (trajectories and phase portraits) in Section
More informationChapter 4 - MATRIX ALGEBRA. ... a 2j... a 2n. a i1 a i2... a ij... a in
Chapter 4 - MATRIX ALGEBRA 4.1. Matrix Operations A a 11 a 12... a 1j... a 1n a 21. a 22.... a 2j... a 2n. a i1 a i2... a ij... a in... a m1 a m2... a mj... a mn The entry in the ith row and the jth column
More information0.1 Rational Canonical Forms
We have already seen that it is useful and simpler to study linear systems using matrices. But matrices are themselves cumbersome, as they are stuffed with many entries, and it turns out that it s best
More informationLinear Algebra Review
Chapter 1 Linear Algebra Review It is assumed that you have had a course in linear algebra, and are familiar with matrix multiplication, eigenvectors, etc. I will review some of these terms here, but quite
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 informationRecall the convention that, for us, all vectors are column vectors.
Some linear algebra Recall the convention that, for us, all vectors are column vectors. 1. Symmetric matrices Let A be a real matrix. Recall that a complex number λ is an eigenvalue of A if there exists
More information18.312: Algebraic Combinatorics Lionel Levine. Lecture (u, v) is a horizontal edge K u,v = i (u, v) is a vertical edge 0 else
18.312: Algebraic Combinatorics Lionel Levine Lecture date: Apr 14, 2011 Lecture 18 Notes by: Taoran Chen 1 Kasteleyn s theorem Theorem 1 (Kasteleyn) Let G be a finite induced subgraph of Z 2. Define the
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 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 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 informationDifferential Topology Final Exam With Solutions
Differential Topology Final Exam With Solutions Instructor: W. D. Gillam Date: Friday, May 20, 2016, 13:00 (1) Let X be a subset of R n, Y a subset of R m. Give the definitions of... (a) smooth function
More informationLaplacian and Random Walks on Graphs
Laplacian and Random Walks on Graphs Linyuan Lu University of South Carolina Selected Topics on Spectral Graph Theory (II) Nankai University, Tianjin, May 22, 2014 Five talks Selected Topics on Spectral
More informationLecture 16: Roots of the Matching Polynomial
Counting and Sampling Fall 2017 Lecture 16: Roots of the Matching Polynomial Lecturer: Shayan Oveis Gharan November 22nd Disclaimer: These notes have not been subjected to the usual scrutiny reserved for
More informationThis section is an introduction to the basic themes of the course.
Chapter 1 Matrices and Graphs 1.1 The Adjacency Matrix This section is an introduction to the basic themes of the course. Definition 1.1.1. A simple undirected graph G = (V, E) consists of a non-empty
More informationIMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET
IMPORTANT DEFINITIONS AND THEOREMS REFERENCE SHEET This is a (not quite comprehensive) list of definitions and theorems given in Math 1553. Pay particular attention to the ones in red. Study Tip For each
More informationMath/CS 466/666: Homework Solutions for Chapter 3
Math/CS 466/666: Homework Solutions for Chapter 3 31 Can all matrices A R n n be factored A LU? Why or why not? Consider the matrix A ] 0 1 1 0 Claim that this matrix can not be factored A LU For contradiction,
More information