DC FieldValueLanguage
dc.contributor.authorAlazemi, Abdullahen
dc.contributor.authorAnđelić, Milicaen
dc.contributor.authorSimić, Slobodanen
dc.date.accessioned2020-05-01T20:12:45Z-
dc.date.available2020-05-01T20:12:45Z-
dc.date.issued2017-01-01en
dc.identifier.issn0354-5180en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1113-
dc.description.abstractWe first prove a formula which relates the characteristic polynomial of a matrix (or of a weighted graph), and some invariants obtained from its principal submatrices (resp. vertex deleted subgraphs). Consequently, we express the spectral radius of the observed objects in the form of power series. In particular, as is relevant for the spectral graph theory, we reveal the relationship between spectral radius of a simple graph and its combinatorial structure by counting certain walks in any of its vertex deleted subgraphs. Some computational results are also included in the paper.en
dc.publisherFaculty of Sciences and Mathematics, University of Niš-
dc.relationKuwait University Research, Grant No. SM03/15-
dc.relation.ispartofFilomaten
dc.subjectCharacteristic polynomial | Graph walks | Spectral radius | Symmetric matrix | Weighted graphen
dc.titleOn the spectral invariants of symmetric matrices with applications in the spectral graph theoryen
dc.typeArticleen
dc.identifier.doi10.2298/FIL1710925Aen
dc.identifier.scopus2-s2.0-85017582665en
dc.relation.firstpage2925en
dc.relation.lastpage2932en
dc.relation.issue10en
dc.relation.volume31en
dc.description.rankM22-
item.cerifentitytypePublications-
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-

Page view(s)

19
checked on Jun 10, 2023