Includes bibliographical references (p. 165-168) and index.
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.
Preliminaries -- Incidence matrix -- Adjacency matrix -- Laplacian matrix -- Cycles and cuts -- Regular graphs -- Algebraic connectivity -- Distance matrix of a tree -- Resistance distance -- Laplacian eigenvalues of threshold graphs -- Positive definite completion problem -- Matrix games based on graphs.