Comprative Study Kirchoff’s and Tutte Matrix Theorem

Abstract

In the mathematical field of graph theory, there are so many topic. In general the Cayley’s formula which provides the number of spanning tree in complete graph. There are two theorem Kirchoff’s Matrix theorem and Tutte Martrix theorem are also used to count spanning tree of a graph. In this paper we focus to count number of spanning in a graph with help of both theorem. At last we draw conclusion that Tutte Matrix theorem approach to compute the number of spanning arborescence of graph also.