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. (C) 2010 Elsevier Inc. All rights reserved.
Titolo: | Combinatorial approach for computing the characteristic polynomial of a matrix |
Autori: | |
Data di pubblicazione: | 2010 |
Rivista: | |
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. (C) 2010 Elsevier Inc. All rights reserved. |
Handle: | http://hdl.handle.net/11570/1904841 |
Appare nelle tipologie: | 14.a.1 Articolo su rivista |
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.