Signed graphs and inverses of their incidence matrices
Abstract
The Laplacian matrix L of a signed graph G may or may not be invertible. We present a combinatorial formula of the Moore-Penrose inverse of L. This is achieved by finding a combinatorial formula for the Moore-Penrose inverse of an incidence matrix of G. This work generalizes related known results on incidence and Laplacian matrices of an unsigned graph. Several examples are provided to show the usefulness of these combinatorial formulas.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.