# Some Results on 2-Lifts of Graphs

Save this PDF as:

Size: px
Start display at page:

## Transcription

1 Some Results on -Lifts of Graphs Carsten Peterson Advised by: Anup Rao August 8, Ramanujan Graphs Let G be a d-regular graph. Every d-regular graph has d as an eigenvalue (with multiplicity equal to the number of connected components), and all other eigenvalues have magnitude less that or equal to d ( d is an eigenvalue if and only if G is bipartite). Eigenvalues of magnitude d are called trivial eigenvalues. Let λ(g) be defined in the following way: λ(g) = max λ i <d λ i Thus λ(g) is the greatest magnitude of the non-trivial eigenvalues of a regular graph. A graph is called a Ramanujan graph if λ(g) d 1. Ramanujan graphs represent an extremal class of graphs as made evident by the following theorem by Alon and Boppana [1]: Theorem 1.1. For every integer d 3 and every ɛ > 0, there exists an n 0 so that every d-regular graph G with more than n 0 vertices has a non-trivial eigenvalue that is greater than d 1 ɛ. Signings and -Lifts A signing of a graph is a function s : E(G) { 1, 1}. Signings prescribe a way of performing -lifts of graphs in the following way: create two copies of the vertex set of G, V 1 (G) and V (G). For each e = a b E(G), if e is positively signed, then create edges a 1 b 1 and a b, and if e is negatively signed, then create edges a 1 b and a b 1. Denote the resulting graph as G s. 1

2 Let A + s (A s ) denote the (adjacency matrix of the) subgraph of G containing only the positively (negatively) signed edges. Notice that A + s + A s = A. Let A s = A + s A s. We call A s the signed adjacency matrix. Proposition.1 ([]). Spec(G s ) = Spec(G) Spec(A s ) Notice then that if we start with a d-regular graph G that is Ramanujan, and we are able to find a signing s such that ρ(a s ) d 1 (ρ here is the spectral radius), then the resulting graph will also be Ramanujan. If we are able to repeat this process at each step, then we would obtain an infinite family of Ramanujan graphs. 3 Paley Graphs Definition 3.1. Let n = p k 1 mod 4 with p prime. The Paley graph on n vertices (P n ) is defined in the following way: let F n be the finite field on n elements. Then, V (P n ) = F n, and E(P n ) = {(a, b) F n F n : a b (F n ) }. Definition 3.. Let H be a graph on n vertices. The complement of H, denoted H or K n \H, has V = V (H) and E = {(a, b) V V : (a, b) / E(H)}. Paley graphs exhibit a number of nice properties: Proposition 3.3. Let n = p k 1 mod 4. Then 1. Spec(P n ) = { 1(n 1) : 1, 1( 1 + n) : 1(n 1), 1( 1 n) : 1(n 1)} with 1 as the eigenvector corresponding to the eigenvalue 1 (n 1) (strong regularity).. P n = Pn (self-complementarity). Paley graphs give us a way of partitioning the complete graph on n vertices (K n ) into two isomorphic pieces. Proposition 3.4. Let n = p k 1 mod 4, and G = K n. Let A + s = P n for some P n K n and A s = P n. Then Spec(A s ) = {0 : 1, n : 1(n 1), n : (n 1)}. 1 Proof. Recall that Spec(K n ) = {n 1 : 1, 1 : n 1} and that 1 is the eigenvector associated with the eigenvalue n 1. Notice that we can write A s = A + s K n. Since 1 is an eigenvector of both A + s and K n, we know it is also an eigenvector of A s with corresponding eigenvalue 1 (n 1) (n

3 1) = 0. By the spectral theorem, we know that all other eigenvectors of A + s are orthogonal to 1, as are all other eigenvectors of K n, all of which have eigenvalues of -1. Thus, all eigenvectors of A + s are eigenvectors of A s. Each eigenvalue of A + s of value 1( 1 + n) becomes an eigenvalue of A s of value 1( 1 + n) + 1 = n (and similarly the eigenvalues 1( 1 n) become n). Since n d 1 = n for all n 3, -lifts of K n performed in this way are Ramanujan. However, this only works when there is a Paley graph on n vertices. We claim that it is in fact possible to perform a Ramanujan -lift for all complete graphs. Theorem l N, n = p k 1 mod 4 l such that every signing s derived from a vertex set σ V (K n ) of size l with A + s = (P n ) σ and = (P n ) σ yields a Ramanujan -lift. A s Here (P n ) σ refers to the vertex-induced subgraph of P n on the vertices in σ. In order to prove this theorem, we first need the following two lemmas: Lemma 3.6 ([4]). (Cauchy s interlacing theorem) If A is a Hermitian matrix, and B is a principal submatrix of A, then the eigenvalues of B interlace the eigenvalues of A. What s particularly notebale about this theorem in this case is that when we have both positive and negative eigenvalues, ρ(b) ρ(a) for all principal submatrices B of A. Lemma 3.7 ([9]). 6 l N, at least two primes between l and l. Proof. (Theorem 3.5) Let n = p k 1 mod 4. Then by Proposition 3.4, we can partition K n into two isomorphic pieces and perform a -lift via the signing s with A + s (K n ) = P n and A s (K n ) = P n. If we choose a subset σ of l of the vertices of K n, then we can derive a signing s for K l with A + s (K l) = (P n ) σ and A s (K l) = (P n ) σ. Notice then that A s is a principal submatrix of A s, so ρ(a s ) ρ(a s ) = n by Lemma 3.6. Thus, if n l, then s necessarily yields a Ramanujan -lift of K l. If we are given l, and we are able to find an n l for which a Paley graph on n vertices exists such that n l (or equivalently l n 4n 8), then following the procedure just described will produce a Ramanujan -lift of K l. In order to apply Lemma 3.7 in the following proof, we need l 6, which implies l 6. It can be easily checked by hand that for all 5 l 5, there is an n sufficiently close by for the prescribed procedure to produce a 3

4 Ramanujan -lift. Now assume that l 6. Notice that for all primes p, p 1 mod 4, so it would be sufficient to find n = p such that l p 4n 8, or equivalently l p l. By Lemma 3.7, there exist at least two primes between l and l. Since l is even, it is not prime, so the largest the largest prime in this range can be is l 1 and the largest the second largest prime in this range can be is l 3. We get the following inequality: l l p l 3 < l + 3 = l 1 l Thus there is necessarily an n = p sufficiently close by for all l 6. 4 Matchings Definition 4.1. A k-matching in a graph is a collection of k edges such that no two edges in the set share a vertex. We denote the number of k-matchings in a graph by m k. Definition 4.. The matching polynomial of a graph G is: µ G (x) := k 0 ( 1) k m k x n k Notice that this is always an even or odd function, so the zeros of µ G (x) are symmetrically distributed. The matching polynomial is a very well-studied object and has a number of nice properties: Theorem 4.3 ([6]). Let G be a graph. Then, 1. µ G (x) is real-rooted.. The roots of µ G (s) all lie in the range [ (G) 1, (G) 1], where (G) is the max degree of all of the vertices in G. Notice that in the case where G is a d-regular graph, all of the roots have magnitude less than or equal to d 1, which is exactly the Ramanujan bound. Indeed, there is a strong connection between the matching polynomial and signings of a graph: Theorem 4.4 ([5]). Let G be a graph and let S be the set of all possible signings s on G. Then, E det(xi A s (G)) = µ G (x) 4

5 Since the proof will be relevant to a later result, it shall be included (from [3]). Proof. Let G be a a graph on n vertices, and let G be the graph obtained by adding loops to each vertex in G. A cycle v 1, v,..., v k = v 1 is simple if v 1 v j for all 1 i < j k 1. A disjoint cycle cover of G is a vertex disjoint collection C = {C 1,..., C l } of simple cycles (loops and two cycles (single edges) are allowed) in G such that their union is V. Define the weight of a cycle C = v 1,...v k to be w(c) = { x if C is a loop ( 1) k s(v 1, v )s(v, v 3 )...s(v k 1, v k ) otherwise The weight of a disjoint cycle cover C = {C 1,..., C l } is w(c) = w(c 1 )...w(c l ). If we extend s so that s(i, j) = 0 whenever {i, j} / E, then det(xi A s (G)) = # of fixed points sign(π)x π S n = C w(c) i not fixed s(i, π(i)) Note that if C is a cycle of length greater than, then Ew(C) = 0 because {s(e)} are independent and each s(e) has expectation 0. If C is a cycle of length, then w(c) = 1. Hence E C w(c) = C={C 1,...,C l } Ew(C 1 )...E(C l ) = C w(c ), where the latter sum is over all disjoint cycle covers into loops and two-cycles. Clearly such cycle covers are in bijection with matchings. This is to say that the expected characteristic polynomial of all signings of a graph is equal to the matching polynomial of the graph. However, though we know that the roots of the expected characteristic polynomial of all signings of the graph, we are not necessarily able to say anything about the roots of the characteristic polynomial of any one signing of the graph. However, Marcus, Spielman, and Srivastava [8] showed that the set of characteristic polynomials of signings of the graph form what they call an interlacing family which allowed them to prove the following theorem: 5

6 Theorem 4.5. (Comparison with Expected Polynomial) Suppose r 1,..., r m C n are independent random vectors. Then, for every k, m m λ k ( r i ri ) λ k (Eχ[ r i ri ](x)), i=1 with positive probability, and the same is true with instead of. We can rephrase signings in terms of independent random vectors, in which case we can apply the theorem and conclude that for a d-regular graph G, there is some signing s such that λ max (A s ) d 1 and there is some other signing t such that λ min (A s ) d 1. However, we are not able to say that there exists some signing that meets both of these conditions at the same time. Nonetheless, we can use Theorem 4.5 in the case where G is a bipartite graph. Bipartite graphs always have symmetrically distributed eigenvalues (that is to say λ Spec(G) λ Spec(G)). Therefore, in a d-regular bipartite graph, any signing s such that λ max (A s ) d 1 necessarily also has λ min (A s ) d 1, so by theorem 4.5, we know that if we start with a bipartite Ramanujan graph (for example, the complete bipartite graph), then at each step there exists a signing s with ρ(a s ) d 1 allowing us to create an infinite family of bipartite Ramanujan graphs. A natural question is to ask how matchings arise in the -lift of a graph. Theorem 4.6. Let s be some signing. Let H G be the set of all subgraphs H of G such that every vertex has degree with all even length cycles of H containing an even number of edges in A s and all odd-length cycles containing an odd number of edges in A s. Let c(h) be the number of components of H, l(h) be the number of components just consisting of single edges, and t(h) be the total number of edges. Let Hk G = {H HG : t(h) k t(h)+l(h)}. Then, m k (G s ) = ( ) l(h) c(h)+t(h) k k t(h) H H G k Proof. Let M be some matching in G s, and let Ms 1 be the edge-induced subgraph of G corresponding to the preimage of M in G. Notice that all vertices in Ms 1 must have valency, that is, Ms 1 must be composed of paths and cycles. Further, notice that if two edges in M arise from the same edge e in G, then e must be its own component in Ms 1. All other edges map back to just one edge in G. Let H be a subgraph of G such that the degree of each vertex is. If we have a path P H of length k, then the image of P in G s will be two i=1 6

7 separate paths of length k. By taking every other edge in each of these paths and one edge from each pair of corresponding edges, we get two different k matchings just from P. If we have a cycle C H of length k with an odd number of edges in A s, then C maps to a cycle of length k in G s. If k is odd, then by taking every other edge of this cycle (there are two possible ways to do this), we obtain a k matching in G s. If k is even, then taking every other edge in the image of C will consist of k pairs of corresponding edges whose preimage will be every other edge in C; thus in this case, C cannot be in the preimage of any matching. Now we consider the case where C has an even number of edges in A s. In this case, C maps to two k cycles in G s. If k is odd, there is no way to choose k edges in the image of C such that one edge from each pair of corresponding edges is chosen, so C cannot be in the preimage of any matching in G s. On the other hand, if k is even, then there are two ways we can choose one edge from each pair of corresponding edges to get a k matching in G s. Thus all preimages of matchings in G s consist of subgraph of G such that each vertex has degree, all odd length cycles have an odd number of edges in A s, and all even length cycles have an even number of edges in A s. Each component of size k in a subgraph H meeting these conditions produces two different k-matchings in G s, and when k = 1, this component could have been the preimage of two different 1-matchings or one -matching. Disconnected components map to disconnected components in lifts. Let H G, Hk G, c(h), l(h), and t(h) be defined as in the theorem. Then if we have H H G with at least k edges (k t(h)) but with k t(h) + l(h) (the maximum number of edges in a matching whose preimage is H is the number of edges in components that aren t single edges plus twice the number of components which are single edges, which is equal to t(h) + l(h)). The number of k-matchings whose preimage is H is c(h) l(h) l(h) k+t(h) ( ) ( ) l(h) l(h) = c(h)+t(h) k k t(h) k t(h) c(h) l(h) determines edges coming from components which are not single edges. l(h) k+t(h) comes from single edge components in ( H which only contribute one edge to a matching whose preimage is H. l(h) k t(h)) stems from the k t(h) single edge components which contribute two edges to a matching whose preimage is H. 7

8 5 Relatively Self-Complementary Signings Definition 5.1. The relative complement of a graph G with respect to a subgraph H is G\H = {e E(G) : e / E(H)}. If H = G\H, we say that H is relatively self-complementary with respect to G. When we have a graph G t which comes from the -lift of some other graph G via the signing t, we get a natural set of signings S RSC such that for s S RSC, A + s = A s, that is say that A + s is relatively self-complementary with respect to G t. Recall that every edge in G becomes two edges in G t which we designate as corresponding edges. Proposition 5.. Let G t be the -lift of the graph G via the signing t. Consider signings s of G t such that A + s contains exactly one edge from each pair of corresponding edges. Then A + s = A s, and the eigenvalues of A s are symmetrically distributed. Proof. Recall that G t contains two copies of the vertex set V (G) which we shall designate as V and V. Notice that for signings chosen in the way described in the proposition, the permutation σ = (v 1 v 1)(v v )...(v n v n) is an isomorphism between A + s and A s, so these two subgraphs are isomorphic. Further, notice that σ is order, which is to say it is its own inverse. Let P be the permutation matrix associated with σ. We know P = P 1, so P 1 A + s P = A s and P 1 A s P = A + s. Thus P 1 A s P = P 1 (A + s A s )P = P 1 A + s P P 1 A s P = A s A + s = A s Since conjugation does not change the spectrum of a matrix, the eigenvalues of A s must be symmetrically distributed. As in the case of the proof by Marcus, Spielman, and Srivastava about the existence of Ramanujan -lifts for bipartite graphs, looking at the expected characteristic polynomial of a set of signings may tell us about the properties of some single signing in that set. The expected characteristic polynomial of all signings was the matching polynomial, but the proof must be modified to deal with the case of relatively self-complementary signings since the edges are now signed in pairs instead of individually. Theorem 5.3. Let G t be the -lift of the graph G based on the signing t. Let S RSC be the set of relatively self-complementary signings of G t as described in Proposition 5.. Let C be as in the proof of Theorem 4.4, and let C be the set of elements in C composed of loops, single edges (two cycles), and cycles consisting of pairs of corresponding edges (that is, the set of edges 8

9 contained in cycles of length 3 consists entirely of pairs of corresponding edges). Then, E s SRSC det(xi A s (G t )) = C w(c ) Proof. The proof is basically the same as the proof of Theorem 4.4. Each pair of corresponding edges is signed independently from every other pair, so the only non-vanishing terms in the expectation are cycle covers composed of loops and edges (just as in Theorem 4.4) as well as cycles composed of corresponding edges, whose signings are dependent and thus non-vanishing. 6 Future Work Interestingly, in all but a few cases tested, the expected characteristic polynomial of relatively self-complementary signings stemming from a Ramanujan -lift of a graph was real-rooted. The few cases where this did not hold were when d = 3 (and in that case it was uncommon). It is computationally infeasible to calculate expected characteristic polynomials on graphs with more than around 40 edges (number of calculations is O( m ), so only graphs with d = 3, 4, 5 have been tested. Seeing as one hallmark of Ramanujan graph is that they satisfy a reformation of the Riemann hypothesis in terms of the Ihara zeta functions for graphs [7], which is a measure of the distribution of cycles in a graph, we suspect that the Ihara zeta function is intricately linked to the expected characteristic polynomial of relatively self-complementary signings. Future work will involve exploring those connections. References [1] N. Alon. Eigenvalues and expanders. Cominatorica, 6():83 96, [] Y. Bilu and N. Linial. Lifts, discrepancy, and nearly optimal spectral gap. Combinatorica, 6(5): , 006. [3] P. Brändén. Lecture notes for interlacing families [4] S. Fisk. A very short proof of Cauchy s interlace theorem for eigenvalues of Hermitian matrices. Amer. Math. Monthly, 11():118, 005. [5] C. D. Godsil and I. Gutman. On the matching polynomial of a graph. Algebraic Methods in Graph Theory, 5:41 49,

10 [6] O. J. Heilmann and E. H. Lieb. Theory of monomer-dimer systems. Communications in Mathematical Physics, 5(3):190 3, 197. [7] M. D. Horton, H. M. Stark, and A. A. Terras. What are zeta functions of graphs and what are they good for? Contemp. Math, 415, 006. [8] A. Marcus, D. Spielman, and N. Srivastava. Interlacing families I: bipartite Ramanujan graphs of all degrees Preprint. [9] S. Ramanujan. A proof of Bertrand s postulate. Journal of the Indian Mathematical Society, 11:181 18,

### SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH

31 Kragujevac J. Math. 25 (2003) 31 49. SHARP BOUNDS FOR THE SUM OF THE SQUARES OF THE DEGREES OF A GRAPH Kinkar Ch. Das Department of Mathematics, Indian Institute of Technology, Kharagpur 721302, W.B.,

### Matrix Norms. Tom Lyche. September 28, Centre of Mathematics for Applications, Department of Informatics, University of Oslo

Matrix Norms Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo September 28, 2009 Matrix Norms We consider matrix norms on (C m,n, C). All results holds for

### COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction

COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact

### Midterm Practice Problems

6.042/8.062J Mathematics for Computer Science October 2, 200 Tom Leighton, Marten van Dijk, and Brooke Cowan Midterm Practice Problems Problem. [0 points] In problem set you showed that the nand operator

### 2.3 Scheduling jobs on identical parallel machines

2.3 Scheduling jobs on identical parallel machines There are jobs to be processed, and there are identical machines (running in parallel) to which each job may be assigned Each job = 1,,, must be processed

### Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs

CSE599s: Extremal Combinatorics November 21, 2011 Lecture 15 An Arithmetic Circuit Lowerbound and Flows in Graphs Lecturer: Anup Rao 1 An Arithmetic Circuit Lower Bound An arithmetic circuit is just like

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +

### Connectivity and cuts

Math 104, Graph Theory February 19, 2013 Measure of connectivity How connected are each of these graphs? > increasing connectivity > I G 1 is a tree, so it is a connected graph w/minimum # of edges. Every

### GROUPS SUBGROUPS. Definition 1: An operation on a set G is a function : G G G.

Definition 1: GROUPS An operation on a set G is a function : G G G. Definition 2: A group is a set G which is equipped with an operation and a special element e G, called the identity, such that (i) the

### Linear Codes. In the V[n,q] setting, the terms word and vector are interchangeable.

Linear Codes Linear Codes In the V[n,q] setting, an important class of codes are the linear codes, these codes are the ones whose code words form a sub-vector space of V[n,q]. If the subspace of V[n,q]

### I. GROUPS: BASIC DEFINITIONS AND EXAMPLES

I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called

### (January 14, 2009) End k (V ) End k (V/W )

(January 14, 29) [16.1] Let p be the smallest prime dividing the order of a finite group G. Show that a subgroup H of G of index p is necessarily normal. Let G act on cosets gh of H by left multiplication.

### ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS

ON GALOIS REALIZATIONS OF THE 2-COVERABLE SYMMETRIC AND ALTERNATING GROUPS DANIEL RABAYEV AND JACK SONN Abstract. Let f(x) be a monic polynomial in Z[x] with no rational roots but with roots in Q p for

### A note on companion matrices

Linear Algebra and its Applications 372 (2003) 325 33 www.elsevier.com/locate/laa A note on companion matrices Miroslav Fiedler Academy of Sciences of the Czech Republic Institute of Computer Science Pod

### princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora

princeton univ. F 13 cos 521: Advanced Algorithm Design Lecture 6: Provable Approximation via Linear Programming Lecturer: Sanjeev Arora Scribe: One of the running themes in this course is the notion of

### The chromatic spectrum of mixed hypergraphs

The chromatic spectrum of mixed hypergraphs Tao Jiang, Dhruv Mubayi, Zsolt Tuza, Vitaly Voloshin, Douglas B. West March 30, 2003 Abstract A mixed hypergraph is a triple H = (X, C, D), where X is the vertex

### Zachary Monaco Georgia College Olympic Coloring: Go For The Gold

Zachary Monaco Georgia College Olympic Coloring: Go For The Gold Coloring the vertices or edges of a graph leads to a variety of interesting applications in graph theory These applications include various

### by the matrix A results in a vector which is a reflection of the given

Eigenvalues & Eigenvectors Example Suppose Then So, geometrically, multiplying a vector in by the matrix A results in a vector which is a reflection of the given vector about the y-axis We observe that

### MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a

### some algebra prelim solutions

some algebra prelim solutions David Morawski August 19, 2012 Problem (Spring 2008, #5). Show that f(x) = x p x + a is irreducible over F p whenever a F p is not zero. Proof. First, note that f(x) has no

### Similarity and Diagonalization. Similar Matrices

MATH022 Linear Algebra Brief lecture notes 48 Similarity and Diagonalization Similar Matrices Let A and B be n n matrices. We say that A is similar to B if there is an invertible n n matrix P such that

### [1] Diagonal factorization

8.03 LA.6: Diagonalization and Orthogonal Matrices [ Diagonal factorization [2 Solving systems of first order differential equations [3 Symmetric and Orthonormal Matrices [ Diagonal factorization Recall:

### Lecture 3: Linear Programming Relaxations and Rounding

Lecture 3: Linear Programming Relaxations and Rounding 1 Approximation Algorithms and Linear Relaxations For the time being, suppose we have a minimization problem. Many times, the problem at hand can

### MATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.

MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column

### 3. Equivalence Relations. Discussion

3. EQUIVALENCE RELATIONS 33 3. Equivalence Relations 3.1. Definition of an Equivalence Relations. Definition 3.1.1. A relation R on a set A is an equivalence relation if and only if R is reflexive, symmetric,

### Continuity of the Perron Root

Linear and Multilinear Algebra http://dx.doi.org/10.1080/03081087.2014.934233 ArXiv: 1407.7564 (http://arxiv.org/abs/1407.7564) Continuity of the Perron Root Carl D. Meyer Department of Mathematics, North

### Introduction to Graph Theory

Introduction to Graph Theory Allen Dickson October 2006 1 The Königsberg Bridge Problem The city of Königsberg was located on the Pregel river in Prussia. The river divided the city into four separate

### Part 2: Community Detection

Chapter 8: Graph Data Part 2: Community Detection Based on Leskovec, Rajaraman, Ullman 2014: Mining of Massive Datasets Big Data Management and Analytics Outline Community Detection - Social networks -

### Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs

Discrete Mathematics & Mathematical Reasoning Chapter 10: Graphs Kousha Etessami U. of Edinburgh, UK Kousha Etessami (U. of Edinburgh, UK) Discrete Mathematics (Chapter 6) 1 / 13 Overview Graphs and Graph

### Conductance, the Normalized Laplacian, and Cheeger s Inequality

Spectral Graph Theory Lecture 6 Conductance, the Normalized Laplacian, and Cheeger s Inequality Daniel A. Spielman September 21, 2015 Disclaimer These notes are not necessarily an accurate representation

### The positive minimum degree game on sparse graphs

The positive minimum degree game on sparse graphs József Balogh Department of Mathematical Sciences University of Illinois, USA jobal@math.uiuc.edu András Pluhár Department of Computer Science University

### 1 Eigenvalues and Eigenvectors

Math 20 Chapter 5 Eigenvalues and Eigenvectors Eigenvalues and Eigenvectors. Definition: A scalar λ is called an eigenvalue of the n n matrix A is there is a nontrivial solution x of Ax = λx. Such an x

### FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES

FUNCTIONAL ANALYSIS LECTURE NOTES: QUOTIENT SPACES CHRISTOPHER HEIL 1. Cosets and the Quotient Space Any vector space is an abelian group under the operation of vector addition. So, if you are have studied

### Chapter 7: Products and quotients

Chapter 7: Products and quotients Matthew Macauley Department of Mathematical Sciences Clemson University http://www.math.clemson.edu/~macaule/ Math 42, Spring 24 M. Macauley (Clemson) Chapter 7: Products

### 3. Linear Programming and Polyhedral Combinatorics

Massachusetts Institute of Technology Handout 6 18.433: Combinatorial Optimization February 20th, 2009 Michel X. Goemans 3. Linear Programming and Polyhedral Combinatorics Summary of what was seen in the

### Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan

Arkansas Tech University MATH 4033: Elementary Modern Algebra Dr. Marcel B. Finan 3 Binary Operations We are used to addition and multiplication of real numbers. These operations combine two real numbers

### Orthogonal Diagonalization of Symmetric Matrices

MATH10212 Linear Algebra Brief lecture notes 57 Gram Schmidt Process enables us to find an orthogonal basis of a subspace. Let u 1,..., u k be a basis of a subspace V of R n. We begin the process of finding

### A 2-factor in which each cycle has long length in claw-free graphs

A -factor in which each cycle has long length in claw-free graphs Roman Čada Shuya Chiba Kiyoshi Yoshimoto 3 Department of Mathematics University of West Bohemia and Institute of Theoretical Computer Science

### Classification of Cartan matrices

Chapter 7 Classification of Cartan matrices In this chapter we describe a classification of generalised Cartan matrices This classification can be compared as the rough classification of varieties in terms

### An inequality for the group chromatic number of a graph

An inequality for the group chromatic number of a graph Hong-Jian Lai 1, Xiangwen Li 2 and Gexin Yu 3 1 Department of Mathematics, West Virginia University Morgantown, WV 26505 USA 2 Department of Mathematics

### A Turán Type Problem Concerning the Powers of the Degrees of a Graph

A Turán Type Problem Concerning the Powers of the Degrees of a Graph Yair Caro and Raphael Yuster Department of Mathematics University of Haifa-ORANIM, Tivon 36006, Israel. AMS Subject Classification:

### Induction. Margaret M. Fleck. 10 October These notes cover mathematical induction and recursive definition

Induction Margaret M. Fleck 10 October 011 These notes cover mathematical induction and recursive definition 1 Introduction to induction At the start of the term, we saw the following formula for computing

### On Integer Additive Set-Indexers of Graphs

On Integer Additive Set-Indexers of Graphs arxiv:1312.7672v4 [math.co] 2 Mar 2014 N K Sudev and K A Germina Abstract A set-indexer of a graph G is an injective set-valued function f : V (G) 2 X such that

### Mathematical Induction

Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,

### Elementary Number Theory We begin with a bit of elementary number theory, which is concerned

CONSTRUCTION OF THE FINITE FIELDS Z p S. R. DOTY Elementary Number Theory We begin with a bit of elementary number theory, which is concerned solely with questions about the set of integers Z = {0, ±1,

### Every Positive Integer is the Sum of Four Squares! (and other exciting problems)

Every Positive Integer is the Sum of Four Squares! (and other exciting problems) Sophex University of Texas at Austin October 18th, 00 Matilde N. Lalín 1. Lagrange s Theorem Theorem 1 Every positive integer

### A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE. 1. Introduction and Preliminaries

Acta Math. Univ. Comenianae Vol. LXVI, 2(1997), pp. 285 291 285 A REMARK ON ALMOST MOORE DIGRAPHS OF DEGREE THREE E. T. BASKORO, M. MILLER and J. ŠIRÁŇ Abstract. It is well known that Moore digraphs do

### Lecture 16 : Relations and Functions DRAFT

CS/Math 240: Introduction to Discrete Mathematics 3/29/2011 Lecture 16 : Relations and Functions Instructor: Dieter van Melkebeek Scribe: Dalibor Zelený DRAFT In Lecture 3, we described a correspondence

### On an anti-ramsey type result

On an anti-ramsey type result Noga Alon, Hanno Lefmann and Vojtĕch Rödl Abstract We consider anti-ramsey type results. For a given coloring of the k-element subsets of an n-element set X, where two k-element

### 6.3 Conditional Probability and Independence

222 CHAPTER 6. PROBABILITY 6.3 Conditional Probability and Independence Conditional Probability Two cubical dice each have a triangle painted on one side, a circle painted on two sides and a square painted

### POWER SETS AND RELATIONS

POWER SETS AND RELATIONS L. MARIZZA A. BAILEY 1. The Power Set Now that we have defined sets as best we can, we can consider a sets of sets. If we were to assume nothing, except the existence of the empty

### A simple criterion on degree sequences of graphs

Discrete Applied Mathematics 156 (2008) 3513 3517 Contents lists available at ScienceDirect Discrete Applied Mathematics journal homepage: www.elsevier.com/locate/dam Note A simple criterion on degree

### P. Jeyanthi and N. Angel Benseera

Opuscula Math. 34, no. 1 (014), 115 1 http://dx.doi.org/10.7494/opmath.014.34.1.115 Opuscula Mathematica A TOTALLY MAGIC CORDIAL LABELING OF ONE-POINT UNION OF n COPIES OF A GRAPH P. Jeyanthi and N. Angel

### The determinant of a skew-symmetric matrix is a square. This can be seen in small cases by direct calculation: 0 a. 12 a. a 13 a 24 a 14 a 23 a 14

4 Symplectic groups In this and the next two sections, we begin the study of the groups preserving reflexive sesquilinear forms or quadratic forms. We begin with the symplectic groups, associated with

### Graphs without proper subgraphs of minimum degree 3 and short cycles

Graphs without proper subgraphs of minimum degree 3 and short cycles Lothar Narins, Alexey Pokrovskiy, Tibor Szabó Department of Mathematics, Freie Universität, Berlin, Germany. August 22, 2014 Abstract

### Perron Frobenius theory and some extensions

and some extensions Department of Mathematics University of Ioannina GREECE Como, Italy, May 2008 History Theorem (1) The dominant eigenvalue of a matrix with positive entries is positive and the corresponding

### Minimally Infeasible Set Partitioning Problems with Balanced Constraints

Minimally Infeasible Set Partitioning Problems with alanced Constraints Michele Conforti, Marco Di Summa, Giacomo Zambelli January, 2005 Revised February, 2006 Abstract We study properties of systems of

### HOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!

Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following

### AN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC

AN ALGORITHM FOR DETERMINING WHETHER A GIVEN BINARY MATROID IS GRAPHIC W. T. TUTTE. Introduction. In a recent series of papers [l-4] on graphs and matroids I used definitions equivalent to the following.

### Section 6.1 - Inner Products and Norms

Section 6.1 - Inner Products and Norms Definition. Let V be a vector space over F {R, C}. An inner product on V is a function that assigns, to every ordered pair of vectors x and y in V, a scalar in F,

### DETERMINANTS 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 RH HANUSA AND THOMAS ZASLAVSKY Abstract We investigate the least common multiple of all subdeterminants,

### 1 if 1 x 0 1 if 0 x 1

Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or

### G = G 0 > G 1 > > G k = {e}

Proposition 49. 1. A group G is nilpotent if and only if G appears as an element of its upper central series. 2. If G is nilpotent, then the upper central series and the lower central series have the same

### GRAPHS AND ZERO-DIVISORS. In an algebra class, one uses the zero-factor property to solve polynomial equations.

GRAPHS AND ZERO-DIVISORS M. AXTELL AND J. STICKLES In an algebra class, one uses the zero-factor property to solve polynomial equations. For example, consider the equation x 2 = x. Rewriting it as x (x

### ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD. 1. Introduction

ON INDUCED SUBGRAPHS WITH ALL DEGREES ODD A.D. SCOTT Abstract. Gallai proved that the vertex set of any graph can be partitioned into two sets, each inducing a subgraph with all degrees even. We prove

### Notes on Determinant

ENGG2012B Advanced Engineering Mathematics Notes on Determinant Lecturer: Kenneth Shum Lecture 9-18/02/2013 The determinant of a system of linear equations determines whether the solution is unique, without

### Math 55: Discrete Mathematics

Math 55: Discrete Mathematics UC Berkeley, Fall 2011 Homework # 5, due Wednesday, February 22 5.1.4 Let P (n) be the statement that 1 3 + 2 3 + + n 3 = (n(n + 1)/2) 2 for the positive integer n. a) What

### Collinear Points in Permutations

Collinear Points in Permutations Joshua N. Cooper Courant Institute of Mathematics New York University, New York, NY József Solymosi Department of Mathematics University of British Columbia, Vancouver,

### Induction Problems. Tom Davis November 7, 2005

Induction Problems Tom Davis tomrdavis@earthlin.net http://www.geometer.org/mathcircles November 7, 2005 All of the following problems should be proved by mathematical induction. The problems are not necessarily

### GROUPS ACTING ON A SET

GROUPS ACTING ON A SET MATH 435 SPRING 2012 NOTES FROM FEBRUARY 27TH, 2012 1. Left group actions Definition 1.1. Suppose that G is a group and S is a set. A left (group) action of G on S is a rule for

### (67902) Topics in Theory and Complexity Nov 2, 2006. Lecture 7

(67902) Topics in Theory and Complexity Nov 2, 2006 Lecturer: Irit Dinur Lecture 7 Scribe: Rani Lekach 1 Lecture overview This Lecture consists of two parts In the first part we will refresh the definition

### The tree-number and determinant expansions (Biggs 6-7)

The tree-number and determinant expansions (Biggs 6-7) André Schumacher March 20, 2006 Overview Biggs 6-7 [1] The tree-number κ(γ) κ(γ) and the Laplacian matrix The σ function Elementary (sub)graphs Coefficients

### ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP. A. K. Das and R. K. Nath

International Electronic Journal of Algebra Volume 7 (2010) 140-151 ON GENERALIZED RELATIVE COMMUTATIVITY DEGREE OF A FINITE GROUP A. K. Das and R. K. Nath Received: 12 October 2009; Revised: 15 December

### ZERO-DIVISOR GRAPHS OF POLYNOMIALS AND POWER SERIES OVER COMMUTATIVE RINGS

ZERO-DIVISOR GRAPHS OF POLYNOMIALS AND POWER SERIES OVER COMMUTATIVE RINGS M. AXTELL, J. COYKENDALL, AND J. STICKLES Abstract. We recall several results of zero divisor graphs of commutative rings. We

### 1. Prove that the empty set is a subset of every set.

1. Prove that the empty set is a subset of every set. Basic Topology Written by Men-Gen Tsai email: b89902089@ntu.edu.tw Proof: For any element x of the empty set, x is also an element of every set since

### MATH 551 - APPLIED MATRIX THEORY

MATH 55 - APPLIED MATRIX THEORY FINAL TEST: SAMPLE with SOLUTIONS (25 points NAME: PROBLEM (3 points A web of 5 pages is described by a directed graph whose matrix is given by A Do the following ( points

### 1. Determine all real numbers a, b, c, d that satisfy the following system of equations.

altic Way 1999 Reykjavík, November 6, 1999 Problems 1. etermine all real numbers a, b, c, d that satisfy the following system of equations. abc + ab + bc + ca + a + b + c = 1 bcd + bc + cd + db + b + c

### APPLICATIONS OF THE ORDER FUNCTION

APPLICATIONS OF THE ORDER FUNCTION LECTURE NOTES: MATH 432, CSUSM, SPRING 2009. PROF. WAYNE AITKEN In this lecture we will explore several applications of order functions including formulas for GCDs and

### Group Theory. Contents

Group Theory Contents Chapter 1: Review... 2 Chapter 2: Permutation Groups and Group Actions... 3 Orbits and Transitivity... 6 Specific Actions The Right regular and coset actions... 8 The Conjugation

PYTHAGOREAN TRIPLES KEITH CONRAD 1. Introduction A Pythagorean triple is a triple of positive integers (a, b, c) where a + b = c. Examples include (3, 4, 5), (5, 1, 13), and (8, 15, 17). Below is an ancient

### NOTES ON LINEAR TRANSFORMATIONS

NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all

### Mathematical Induction. Lecture 10-11

Mathematical Induction Lecture 10-11 Menu Mathematical Induction Strong Induction Recursive Definitions Structural Induction Climbing an Infinite Ladder Suppose we have an infinite ladder: 1. We can reach

### Group Theory (MA343): Lecture Notes Semester I Dr Rachel Quinlan School of Mathematics, Statistics and Applied Mathematics, NUI Galway

Group Theory (MA343): Lecture Notes Semester I 2013-2014 Dr Rachel Quinlan School of Mathematics, Statistics and Applied Mathematics, NUI Galway November 21, 2013 Contents 1 What is a group? 2 1.1 Examples...........................................

### Mathematics Course 111: Algebra I Part IV: Vector Spaces

Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are

### DATA ANALYSIS II. Matrix Algorithms

DATA ANALYSIS II Matrix Algorithms Similarity Matrix Given a dataset D = {x i }, i=1,..,n consisting of n points in R d, let A denote the n n symmetric similarity matrix between the points, given as where

### Quotient Rings and Field Extensions

Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.

### Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010. Chapter 7: Digraphs

MCS-236: Graph Theory Handout #Ch7 San Skulrattanakulchai Gustavus Adolphus College Dec 6, 2010 Chapter 7: Digraphs Strong Digraphs Definitions. A digraph is an ordered pair (V, E), where V is the set

### k, then n = p2α 1 1 pα k

Powers of Integers An integer n is a perfect square if n = m for some integer m. Taking into account the prime factorization, if m = p α 1 1 pα k k, then n = pα 1 1 p α k k. That is, n is a perfect square

### R u t c o r Research R e p o r t. Boolean functions with a simple certificate for CNF complexity. Ondřej Čepeka Petr Kučera b Petr Savický c

R u t c o r Research R e p o r t Boolean functions with a simple certificate for CNF complexity Ondřej Čepeka Petr Kučera b Petr Savický c RRR 2-2010, January 24, 2010 RUTCOR Rutgers Center for Operations

### Chapter 17. Orthogonal Matrices and Symmetries of Space

Chapter 17. Orthogonal Matrices and Symmetries of Space Take a random matrix, say 1 3 A = 4 5 6, 7 8 9 and compare the lengths of e 1 and Ae 1. The vector e 1 has length 1, while Ae 1 = (1, 4, 7) has length

### 6.2 Permutations continued

6.2 Permutations continued Theorem A permutation on a finite set A is either a cycle or can be expressed as a product (composition of disjoint cycles. Proof is by (strong induction on the number, r, of

### Special Classes of Divisor Cordial Graphs

International Mathematical Forum, Vol. 7,, no. 35, 737-749 Special Classes of Divisor Cordial Graphs R. Varatharajan Department of Mathematics, Sri S.R.N.M. College Sattur - 66 3, Tamil Nadu, India varatharajansrnm@gmail.com

### MA651 Topology. Lecture 6. Separation Axioms.

MA651 Topology. Lecture 6. Separation Axioms. This text is based on the following books: Fundamental concepts of topology by Peter O Neil Elements of Mathematics: General Topology by Nicolas Bourbaki Counterexamples

### The Open University s repository of research publications and other research outputs

Open Research Online The Open University s repository of research publications and other research outputs The degree-diameter problem for circulant graphs of degree 8 and 9 Journal Article How to cite:

### USE OF EIGENVALUES AND EIGENVECTORS TO ANALYZE BIPARTIVITY OF NETWORK GRAPHS

USE OF EIGENVALUES AND EIGENVECTORS TO ANALYZE BIPARTIVITY OF NETWORK GRAPHS Natarajan Meghanathan Jackson State University, 1400 Lynch St, Jackson, MS, USA natarajan.meghanathan@jsums.edu ABSTRACT This

### Au = = = 3u. Aw = = = 2w. so the action of A on u and w is very easy to picture: it simply amounts to a stretching by 3 and 2, respectively.

Chapter 7 Eigenvalues and Eigenvectors In this last chapter of our exploration of Linear Algebra we will revisit eigenvalues and eigenvectors of matrices, concepts that were already introduced in Geometry

### 1D 3D 1D 3D. is called eigenstate or state function. When an operator act on a state, it can be written as

Chapter 3 (Lecture 4-5) Postulates of Quantum Mechanics Now we turn to an application of the preceding material, and move into the foundations of quantum mechanics. Quantum mechanics is based on a series

### Algebra of the 2x2x2 Rubik s Cube

Algebra of the 2x2x2 Rubik s Cube Under the direction of Dr. John S. Caughman William Brad Benjamin. Introduction As children, many of us spent countless hours playing with Rubiks Cube. At the time it