The Determinant of Graphs Joined by $j$ Edges

Daniel Pinzon, Boyko Gyurov

Authors

  • Support Team

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.

Downloads

Published

2016-08-01

How to Cite

Team, S. (2016). The Determinant of Graphs Joined by $j$ Edges: Daniel Pinzon, Boyko Gyurov. Thai Journal of Mathematics, 14(2), 353–367. Retrieved from https://thaijmath2.in.cmu.ac.th/index.php/thaijmath/article/view/602

Issue

Section

Articles