Based on 10 lectures given at the cbms workshop on spectral graph theory in june 1994 at fresno state university, this exposition can be likened to a conversation with a good teacher one who not only gives you the facts, but tells you what is really going on, why it is worth doing, and how it is related to familiar ideas in other areas. Spectral graph theory inthisnoteiusesometerminologiesaboutgraphswithoutde. We have already seen the vertexedge incidence matrix, the laplacian and the adjacency matrix of a graph. Economics 31 this is an introductory chapter to our book. Here we shall concentrate mainly on the adjacency matrix of undirected graphs, and.
In this paper, we focus on the connection between the eigenvalues of the laplacian matrix and graph connectivity. For other books on spe ctral graph theory, see chung 89, cvetkovi. Dec 03, 1996 based on 10 lectures given at the cbms workshop on spectral graph theory in june 1994 at fresno state university, this exposition can be likened to a conversation with a good teacher one who not only gives you the facts, but tells you what is really going on, why it is worth doing, and how it is related to familiar ideas in other areas. Spectral and algebraic graph theory yale university. Spectral graph theory to appear in handbook of linear algebra, second edition, ccr press steve butler fan chungy there are many di erent ways to associate a matrix with a graph an introduction of which can be found in chapter 28 on matrices and graphs. Besides graph theoretic research on the relationship between structural and spectral properties of graphs, another major source was research in quantum chemistry, but the connections between these two lines of work were not discovered until much later. If fix outside face, and let every other vertex be average of neighbors, get planar embedding of planar graph. Lectures on spectral graph theory fan rk chung ucsd math. Pdf in graph theory, every graph can be expressed in terms of certain real, symmetric matrices derived from the graph, most notably the adjacency or. Introduction to spectral graph theory, cheegers inequality are the eigenvalues of ld.
There are three tasks that one must accomplish in the beginning of a course on spectral graph theory. Spectral graph theory uri feige january 2010 1 background with every graph or digraph one can associate several di. In the summer of 2006, the daunting task of revision finally but surely got started. The focus of spectral graph theory is to examine the eigenvalues. I personally think biggs is somewhat dated but more accesible for beginners. Spectral graph theory from wikipedia, the free encyclopedia in mathematics, spectral graph theory is the study of properties of a graph in relationship to the characteristic polynomial, eigenvalues, and eigenvectors of matrices associated to the graph such as its adjacency matrix or laplacian matrix. In infinite dimensions, the spectrum need not consist solely of isolated eigenvalues. In fact, the number of graphs of ordern without unique spectrum is believed to be at least. But avoid asking for help, clarification, or responding to other answers. What properties of a graph are exposedrevealed if we 1 represent the graph as. Beautifully written and elegantly presented, this book is based on 10 lectures given at the cbms workshop on spectral graph theory in june 1994 at fresno state university.
More in particular, spectral graph the ory studies the relation between graph properties and the spectrum of the adjacency matrix or laplace matrix. Spectral graph theory emerged in the 1950s and 1960s. It is this aspect that we intend to cover in this book. The theory of isospectral operators is markedly different depending on whether the space is finite or infinite dimensional. Many of the problems that these approaches apply to are graph problems such as graph cut and the maximum flow problems. Spectral graph theory revised and improved fan chung the book was published by ams in 1992 with a second printing in 1997. Wilson he has edited selected topics in graph theory 3 volumes, applications of graph theory and graph connections. This perhaps is an indication of how little we know how to use the spectrum to examine the graph. When the cartesian product of two directed cycles is hypohamiltonian, journal of graph theory 7 1983 441443. One of our new constructions is sufficiently powerful to produce an estimated 72% of the 51039 graphs on 9 vertices which do not have unique spectrum. Spectral graph theory has applications to the design and analysis of approximation algorithms for graph partitioning problems, to the study of random. Due to the recent discovery of very fast solvers for these equations, they are also becoming increasingly useful in combinatorial opti. Selected bibliographies on applications of the theory of graph spectra 19 4. There is a large literature on algebraic aspects of spectral graph theory, well documented in several surveys and books, such as biggs 25, cvetkovic.
Following the wikipedia breakdown of algebraic graph theory, the linear algebra of a graph is morally its spectral theory, if you interpret energy estimates, eigenvalue distribution and so on as normed algebra. One feature of the paper of hoffman and singleton is that its conclusion makes no reference to spectra. Spectral and algebraic graph theory computer science yale. However, the underlying mathematics of spectral graph theory through all its connections to the pure and applied, the continuous and discrete, can be viewed as a single uni ed subject. Spectral graph theory and its applications daniel a. Besides graph theoretic research on the relationship between structural and spectral properties of graphs, another major source was research in quantum chemistry, but the connections between these two lines of. The book itself can be kind of dense in the material it presents, but never overwhelmingly so. At a very high level the course shows how one can use linear algebra to solve fundamental problems in computer science much more efficiently. Another good reference is biggs algebraic graph theory as well as godsil and royles algebraic graph theory same titles, different books. Laplaces equation and its discrete form, the laplacian matrix, appear ubiquitously in mathematical physics. Sometimes, we will use the term kcycle to precise that the considered cycle has k vertices. Algebraic graph theory is the branch of mathematics that studies graphs by using algebraic properties of associated matrices.
Chungs wellwritten exposition can be likened to a conversation with a good teacherone who not only gives you the facts, but tells you what is really going on, why it is. Spectral graph theory is the interplay between linear algebra and combinatorial graph theory. This is also true in graph theory, and this aspect of graph theory is known as spectral graph theory. Planar graphs have genus 0 sphere, disc, and annulus has genus 0 torus has genus 1 for every g, there is a class of bounded degree graphs that have no bisectors smaller than ogn. Lecture notes on expansion, sparsest cut, and spectral graph theory. A good book that is available as a free pdf is spectra of graphs by brouwer and haemers i personally am partial to the normalized laplacian in which case you would want to look at spectral graph theory by chung. Some problems in graph theory and graphs algorithmic theory. The following theorem is one of the fundamental results in spectral graph theory with many applications in complexity theory, coding theory, analysis of random walks, approximation algorithms, etc. In spectral graph theory almost all of the focus and energy has been put into only the few largest and few lowest eigenvalues, the middle range of the spectra being usually neglected. Graphs as matrices, spectral graph theory, and pagerank david glickenstein november 3, 2014 1 representing graphs as matrices it will sometimes be useful to represent graphs as matrices. In the early days, matrix theory and linear algebra. One must convey how the coordinates of eigenvectors correspond to vertices in a graph. An introduction to spectral graph theory contents 1.
Thanks for contributing an answer to theoretical computer science stack exchange. The theory of graph spectra can, in a way, be considered as an attempt to utilize linear algebra including, in particular, the welldeveloped theory of matrices for the purposes of graph theory and its applications. For graph theorists it flowered into the the theory of distanceregular graphs, starting with the work of biggs and his students, and still very active. There is an interesting analogy between spectral riemannian geometry and spectral graph theory. Create a metric useful in visualizaon finding approximate distances clustering using eigen vectors. This book is mostly based on lecture notes from the spectral graph theory course that i have taught at yale, with notes from graphs and networks and. A brief introduction to spectral graph theory ems european. Some of these use matrices to describe the characteristics of the different vertices and edges of a graph.
For more algebraic graph theory, see biggs 28, godsil 164 and godsil. Chung, 9780821803158, available at book depository with free delivery worldwide. He is currently editor of college mathematical journal. Spectral graph theory studies how the eigenvalues of the adjacency matrix of a graph, which are purely algebraic quantities, relate to combinatorial properties of the graph. In this note we never consider directed graphs and so the adjacency matrix will always be. One of the most useful invariants of a matrix to look in linear algebra at are its eigenvalues and eigenspaces. If fix outside face, and let every other vertex be average of.
Chungs spectral graph theory book focuses mostly on the normalized laplacian, but this is also good to look into. The concepts and methods of spectral geometry bring useful tools and crucial insights to the study of graph eigenvalues, which in turn lead to new directions and results in spectral geometry. Rather, my goal is to introduce the main ideas and to provide intuition. Some of these use matrices to describe the characteristics of the. Pdf cospectral graphs and the generalized adjacency matrix.
Planar graphs have genus 0 sphere, disc, and annulus has genus 0 torus has genus 1 for every g, there is a class of bounded degree. The main objective of spectral graph theory is to relate properties of graphs with the eigenvalues and eigenvectors spectral properties of associated matrices. Lectures on spectral graph theory ucsd mathematics. Ems textbooks in mathematics bogdan nica mcgill university, montreal, canada. However, substantial revision is clearly needed as the list of errata got longer.
Spectral graph theory and random walks on graphs algebraic graph theory is a major area within graph theory. Some new constructions for families of cospectral graphs are derived, and some old ones are considerably generalized. Chungs wellwritten exposition can be likened to a conversation with a good teacherone who not only gives you the facts. In this note we never consider directed graphs and so the adjacency. Two networks with a different structure can be distinguished from each other by complete. Graph embedding find posiions for verices of a graph in low dimension compared to n common objecve. One of the most useful invariants of a matrix to look in linear algebra at are its eigenvalues. Chung is an expert in the field and youre probably not going to find a better book than this if youre looking to get into the concepts of the field of spectral graph theory.
Is there a theoretically interesting spectral theory. Also, we use the adjacency matrix of a graph to count the number of simple paths of length up to 3. Spectral graph theory, by fan chung ucsd mathematics. Chapter 1 eigenvalues and the laplacian of a graph 1. Lecture notes on expansion, sparsest cut, and spectral. In the early days, matrix theory and linear algebra were used to analyze adjacency matrices of graphs. His graph theory interests include topological graph theory, line graphs, tournaments, decompositions and vulnerability. Spectral graph theory studies how the eigenvalues of the adjacency matrix of a graph, which are purely algebraic quantities, relate to. Spectral graph theory studies connections between combinatorial properties of graphs and the eigenvalues of matrices associated to the graph, such as the adjacency matrix and the laplacian matrix. Spectral graph theory cbms regional conference series in. One of the main themes of algebraic graph theory comes from the following question. Spectral graph theory is the study of properties of the laplacian matrix or adjacency matrix associated with a graph.
In finitedimensions, one essentially deals with square matrices. Given a graph g, the most obvious matrix to look at is its adjacency matrix a, however there are others. In this note i use some terminologies about graphs without defining them. These lecture notes will talk about various matrices which can be associated with a graph, like adjacency, edge adjacency and laplacian matrix. So it offers an important graph theoretical result for which the book proof uses. Spectral graph theory simons institute for the theory of. For instance, star graphs and path graphs are trees. Basic graph theory stu formally, a graph is a pair g v.
388 1282 897 988 58 1453 1558 1347 1404 1319 1348 932 1370 1309 1336 1485 110 530 237 388 1457 1414 565 570 518 633 546 457 1538 376 119 267 1050 355 260 895 577 966 923 1223 1438