Compound connection matrices |
| |
Authors: | David P Brown |
| |
Institution: | Department of Electrical and Computer Engineering, University of Wisconsin-Madison, Madison, WI 53706, USA |
| |
Abstract: | Suppose T is an incidence, basis circuit or basis cut set matrix of a connected graph and T(k) is the k compound of T. It is proven that any second order minor of T(k) is equal +1, −1, or 0. For the case of an incidence matrix this result is applied to tree counting and some structural properties of T(k) are given. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|