The Determinant of Graphs Joined by $j$ Edges

Daniel Pinzon, Boyko Gyurov

Abstract

In this paper, we refine a result obtained in [4] to compute the determinant of a graph that is constructed by joining two graphs with two new non-coinsiding undirected edges. Here we join the two graphs with $j$ edges and create a procedure to decompose the determinant of the combied graph.