The Mutually Beneficial Relationship Of Graphs And Matrices
Download and Read The Mutually Beneficial Relationship Of Graphs And Matrices full books in PDF, ePUB, and Kindle. Read online free The Mutually Beneficial Relationship Of Graphs And Matrices ebook anywhere anytime directly on your device. We cannot guarantee that every ebooks is available!
The Mutually Beneficial Relationship of Graphs and Matrices
Author | : Richard A. Brualdi |
Publisher | : American Mathematical Soc. |
Total Pages | : 110 |
Release | : 2011-07-06 |
Genre | : Mathematics |
ISBN | : 0821853155 |
Download The Mutually Beneficial Relationship of Graphs and Matrices Book in PDF, Epub and Kindle
Graphs and matrices enjoy a fascinating and mutually beneficial relationship. This interplay has benefited both graph theory and linear algebra. In one direction, knowledge about one of the graphs that can be associated with a matrix can be used to illuminate matrix properties and to get better information about the matrix. Examples include the use of digraphs to obtain strong results on diagonal dominance and eigenvalue inclusion regions and the use of the Rado-Hall theorem to deduce properties of special classes of matrices. Going the other way, linear algebraic properties of one of the matrices associated with a graph can be used to obtain useful combinatorial information about the graph. The adjacency matrix and the Laplacian matrix are two well-known matrices associated to a graph, and their eigenvalues encode important information about the graph. Another important linear algebraic invariant associated with a graph is the Colin de Verdiere number, which, for instance, characterizes certain topological properties of the graph. This book is not a comprehensive study of graphs and matrices. The particular content of the lectures was chosen for its accessibility, beauty, and current relevance, and for the possibility of enticing the audience to want to learn more.
The Mutually Beneficial Relationship of Graphs and Matrices Related Books
Pages: 110
Pages: 317
Pages: 143
Pages: 219
Pages: 237