Graph theory: flows, matrices
Choice Reviews Online · 1992
STRUCTURE OF THE GRAPH MODEL The abstract graph Geometrical realization of graphs Components Leaves Blocks The strongly connected components of directed graphs Problems OPTIMAL FLOWS Two basic problems Maximal set of independent paths The optimal assignment problem The Hungarian method Max flow-min cut Dynamic flow The mobilization problem The synthesis of flow problems Optical planning The role of the critical path Minimal cost transportation Minimal cost flows Problems GRAPHS AND MATRICES The adjacency matrix The incidence matrix The circuit matrix Interrelations between the matrices of graphs The spectrum of graphs, the complexity Linear electrical networks Further matrices associated with graphs Problems and solutions