Skew spectrum of the Cartesian product of an oriented graph with an oriented hypercube / A. Anuradha, R. Balakrishnan -- Notes on explicit block diagonalization / Murali K. Srinivasan -- The third immanant of q-Laplacian matrices of trees and Laplacians of regular graphs / R.B. Bapat -- Matrix prod
Combinatorial Matrix Theory
โ Scribed by Richard A. Brualdi, Herbert J. Ryser
- Publisher
- Cambridge University Press
- Year
- 1991
- Tongue
- English
- Leaves
- 377
- Series
- Encyclopedia of Mathematics and its Applications volume 39
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
The book deals with the many connections between matrices, graphs, diagraphs and bipartite graphs. The basic theory of network flows is developed in order to obtain existence theorems for matrices with prescribed combinatorical properties and to obtain various matrix decomposition theorems. Other chapters cover the permanent of a matrix and Latin squares. The book ends by considering algebraic characterizations of combinatorical properties and the use of combinatorial arguments in proving classical algebraic theorems, including the Cayley-Hamilton Theorem and the Jorda Canonical Form.
๐ SIMILAR VOLUMES
<p>This book consists of eighteen articles in the area of `Combinatorial Matrix Theory' and `Generalized Inverses of Matrices'. Original research and expository articles presented in this publication are written by leading Mathematicians and Statisticians working in these areas. The articles contain
''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 represen
On the surface, matrix theory and graph theory seem like very different branches of mathematics. However, adjacency, Laplacian, and incidence matrices are commonly used to represent graphs, and many properties of matrices can give us useful information about the structure of graphs. Applications of
The book deals with the many connections between matrices, graphs, diagraphs and bipartite graphs. The basic theory of network flows is developed in order to obtain existence theorems for matrices with prescribed combinatorical properties and to obtain various matrix decomposition theorems. Other ch
The book deals with the many connections between matrices, graphs, diagraphs and bipartite graphs. The basic theory of network flows is developed in order to obtain existence theorems for matrices with prescribed combinatorical properties and to obtain various matrix decomposition theorems. Other ch