Spanning Tree Results for Graphs and Multigraphs: A Matrix-Theoretic Approach.pdf

Spanning Tree Results for Graphs and Multigraphs: A Matrix-Theoretic Approach.pdf
 

书籍描述

内容简介
In this work, we consider the optimization problem of maximizing the number of spanning trees among graphs and multigraphs in the same class, i.e. having a fixed number of nodes and a fixed number of edges. Since a spanning tree is a minimally connected subgraph, graphs and multigraphs having more of these are, in some sense, immune to disconnection by edge failure. The authors envision this as a research aid that is of particular interest to graduate students or advanced undergraduate students and researchers in the area of network reliability theory. This would encompass graph theorists of all stripes, including mathematicians, computer scientists, electrical and computer engineers, and operations researchers.

目录
Graph Theory Background; Matrix Theory Background, including Kroenecker Products, and Proofs of the Binet - Cauchy and Courant - Fischer Theorems; Spanning Tree Results for a Host of Graphs as well as Multigraphs; Node-Arc Incidence Matrix; Temperley's B Matrix. Multigraphs; Eigenvalues and Eigenvalue Bounds; A Lagrange Multiplier Approach to the Spanning Tree Problem.

购买书籍

当当网购书 京东购书 卓越购书

PDF电子书下载地址

相关书籍

搜索更多