Authors: Belardo, Francesco
Li Marzi, Enzo
Simić, Slobodan 
Affiliations: Mathematical Institute of the Serbian Academy of Sciences and Arts 
Title: Combinatorial approach for computing the characteristic polynomial of a matrix
Journal: Linear Algebra and Its Applications
Volume: 433
Issue: 8-10
First page: 1513
Last page: 1523
Issue Date: 15-Dec-2010
Rank: M22
ISSN: 0024-3795
DOI: 10.1016/j.laa.2010.05.010
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.
Keywords: Characteristic polynomial | Coates digraph | Weighted digraph
Publisher: Elsevier
Project: PRIN 2008 “Disegni Combinatorici, Grafi e loro Applicazioni” (Italy)
Serbian Ministry for Science (Grant 144015G)

Show full item record


checked on May 20, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.