DC Field | Value | Language |
---|---|---|
dc.contributor.author | Belardo, Francesco | en |
dc.contributor.author | Li Marzi, Enzo | en |
dc.contributor.author | Simić, Slobodan | en |
dc.date.accessioned | 2020-05-01T20:12:48Z | - |
dc.date.available | 2020-05-01T20:12:48Z | - |
dc.date.issued | 2010-12-15 | en |
dc.identifier.issn | 0024-3795 | en |
dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/1143 | - |
dc.description.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. | en |
dc.publisher | Elsevier | - |
dc.relation | PRIN 2008 “Disegni Combinatorici, Grafi e loro Applicazioni” (Italy) | - |
dc.relation | Serbian Ministry for Science (Grant 144015G) | - |
dc.relation.ispartof | Linear Algebra and Its Applications | en |
dc.subject | Characteristic polynomial | Coates digraph | Weighted digraph | en |
dc.title | Combinatorial approach for computing the characteristic polynomial of a matrix | en |
dc.type | Article | en |
dc.identifier.doi | 10.1016/j.laa.2010.05.010 | en |
dc.identifier.scopus | 2-s2.0-77956395206 | en |
dc.contributor.affiliation | Mathematical Institute of the Serbian Academy of Sciences and Arts | - |
dc.relation.firstpage | 1513 | en |
dc.relation.lastpage | 1523 | en |
dc.relation.issue | 8-10 | en |
dc.relation.volume | 433 | en |
dc.description.rank | M22 | - |
item.fulltext | No Fulltext | - |
item.openairetype | Article | - |
item.grantfulltext | none | - |
item.cerifentitytype | Publications | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
SCOPUSTM
Citations
32
checked on Apr 3, 2025
Page view(s)
24
checked on Jan 31, 2025
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.