The mutually beneficial relationship of graphs and matrices / Richard A. Brualdi

Auteur principal : Brualdi, Richard A., 1939-, AuteurType de document : MonographieCollection : Regional conference series in mathematics, 115Langue : anglais.Pays: Etats Unis.Éditeur : Providence (R.I.) : American Mathematical Society, 2011Description : 1 vol. (IX-96 p.) : fig. ; 26 cmISBN: 9780821853153.ISSN: 0160-7642.Bibliographie : Bibliogr. en fin de chapitres. Index.Sujet MSC : 05-02, Research exposition (monographs, survey articles) pertaining to combinatorics
05C50, Combinatorics - Graph theory, Graphs and linear algebra (matrices, eigenvalues, etc.)
15B35, Special matrices, Sign pattern matrices
Tags from this library: No tags from this library for this title. Log in to add tags.
Holdings
Item type Current library Call number Status Date due Barcode
 Monographie Monographie CMI
Salle 1
05 BRU (Browse shelf(Opens below)) Available 06763-01

Basé sur les conférences données par l'auteur à l'Iowa State University du 12 au 16 juillet 2010.

Bibliogr. en fin de chapitres. Index

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 Verdière 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. (Source : 4ème de couverture)

There are no comments on this title.

to post a comment.