Combinatorial approach for computing the characteristic polynomial of a matrix

Abstract

The study of the spectrum of weighted (di)graphs has attracted recently much attention in the literature. Here we use the Coates digraph as a main tool to extend, in a combinatorial way, some well known results from the spectral graph theory on computing the characteristic polynomial of graphs. New results are related to weighted (di)graph, and thus to any square matrix.