Graphs and Matrices (Universitext)

R. B. Bapat

ISBN 10: 1848829809 / ISBN 13: 9781848829800

Editore: Springer 2011-03-09, 2011

Riguardo questo articolo

Codice articolo 6666-IUK-9781848829800

Dati bibliografici

• Titolo: Graphs and Matrices (Universitext)
• Editore: Springer 2011-03-09
• Data di pubblicazione: 2011
• Lingua: Inglese
• ISBN 10: 1848829809
• ISBN 13: 9781848829800
• Rilegatura: Paperback
• Condizione: New

Descrizione articolo

Riassunto

Graphs and Matrices provides a welcome addition to the rapidly expanding selection of literature in this field. As the title suggests, the book’s primary focus is graph theory, with an emphasis on topics relating to linear algebra and matrix theory. Information is presented at a relatively elementary level with the view of leading the student into further research. In the first part of the book matrix preliminaries are discussed and the basic properties of graph-associated matrices highlighted. Further topics include those of graph theory such as regular graphs and algebraic connectivity, Laplacian eigenvalues of threshold graphs, positive definite completion problem and graph-based matrix games. Whilst this book will be invaluable to researchers in graph theory, it may also be of benefit to a wider, cross-disciplinary readership.

Dalla quarta di copertina

<p>Whilst it is a moot point amongst researchers, linear algebra is an important component in the study of graphs. This book illustrates the elegance and power of matrix techniques in the study of graphs by means of several results, both classical and recent. The emphasis on matrix techniques is greater than other standard references on algebraic graph theory, and the important matrices associated with graphs such as incidence, adjacency and Laplacian matrices are treated in detail.</p> <p>Presenting a useful overview of selected topics in algebraic graph theory, early chapters of the text focus on regular graphs, algebraic connectivity, the distance matrix of a tree, and its generalized version for arbitrary graphs, known as the resistance matrix. Coverage of later topics include Laplacian eigenvalues of threshold graphs, the positive definite completion problem and matrix games based on a graph.</p><p>Such an extensive coverage of the subject area provides a welcome prompt for further exploration, and the inclusion of exercises enables practical learning throughout the book. It may also be applied to a selection of sub-disciplines within science and engineering.</p> <p>Whilst this book will be invaluable to students and researchers in graph theory and combinatorial matrix theory who want to be acquainted with matrix theoretic ideas used in graph theory, it will also benefit a wider, cross-disciplinary readership.</p>