Description 
1 online resource (405 pages) : illustrations 
Series 
Discrete mathematics and its applications 

Discrete mathematics and its applications.

Contents 
1. Matrix theory preliminaries  2. Graph theory preliminaries  3. Introduction to Laplacian matrices  4. The spectra of Laplacian matrices  5. The algebraic connectivity  6. The Fiedler vector and bottleneck matrices for trees  7. Bottleneck matrices for graphs  8. The group inverse of the Laplacian matrix 
Summary 
"Preface On the surface, matrix theory and graph theory are seemingly very different branches of mathematics. However, these two branches of mathematics interact since it is often convenient to represent a graph as a matrix. Adjacency, Laplacian, and incidence matrices are commonly used to represent graphs. In 1973, Fiedler published his first paper on Laplacian matrices of graphs and showed how many properties of the Laplacian matrix, especially the eigenvalues, can give us useful information about the structure of the graph. Since then, many papers have been published on Laplacian matrices. This book is a compilation of many of the exciting results concerning Laplacian matrices that have been developed since the mid 1970's. Papers written by wellknown mathematicians such as (alphabetically) Fallat, Fiedler, Grone, Kirkland, Merris, Mohar, Neumann, Shader, Sunder, and several others are consolidated here. Each theorem is referenced to its appropriate paper so that the reader can easily do more indepth research on any topic of interest. However, the style of presentation in this book is not meant to be that of a journal but rather a reference textbook. Therefore, more examples and more detailed calculations are presented in this book than would be in a journal article. Additionally, most sections are followed by exercises to aid the reader in gaining a deeper understanding of the material. Some exercises are routine calculations that involve applying the theorems presented in the section. Other exercises require a more indepth analysis of the theorems and require the reader to prove theorems that go beyond what was presented in the section. Many of these exercises are taken from relevant papers and they are referenced accordingly"Provided by publisher 
Bibliography 
Includes bibliographical references and index 
Notes 
Print version record 
Subject 
Graph connectivity.


Laplacian matrices.


COMPUTERS  Operating Systems  General.


COMPUTERS  Programming  Algorithms.


Graph connectivity.


Laplacian matrices.


MATHEMATICS  Combinatorics.


MATHEMATICS  Matrices.

Form 
Electronic book

ISBN 
1439863393 

9781439863398 
