Published in

Elsevier, Linear Algebra and its Applications, 8-10(433), p. 1513-1523, 2010

DOI: 10.1016/j.laa.2010.05.010

Links

Tools

Export citation

Search in Google Scholar

Combinatorial approach for computing the characteristic polynomial of a matrix

Journal article published in 2010 by Francesco Belardo ORCID, Enzo M. Li Marzi, Slobodan K. Simić
This paper is made freely available by the publisher.
This paper is made freely available by the publisher.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Orange circle
Postprint: archiving restricted
Upload
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

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.