Cyclic matrices of weighted digraphs

In this paper, we address several properties of the so-called augmented cyclic matrices of weighted digraphs. These matrices arise in different applications of digraph theory to electrical circuit analysis, and can be seen as an enlargement of basic cyclic matrices of the form BWBTBWBT, where BB is a cycle matrix and WW is a diagonal matrix of weights. By using certain matrix factorizations and some properties of cycle bases, we characterize the determinant of augmented cyclic matrices, via Cauchy–Binet expansions, in terms of the so-called proper cotrees. In the simpler context defined by basic cyclic matrices, we obtain the dual result of Maxwell’s determinantal expansion for weighted Laplacian (nodal) matrices. Additional relations with nodal matrices are also discussed. We apply this framework to the characterization of the differential–algebraic circuit models arising from loop analysis, and also to the analysis of branch-oriented models of circuits including charge-controlled memristors.