DC FieldValueLanguage
dc.contributor.authorSimić, Slobodanen
dc.contributor.authorStanić, Zoranen
dc.date.accessioned2020-05-01T20:12:50Z-
dc.date.available2020-05-01T20:12:50Z-
dc.date.issued2008-04-15en
dc.identifier.issn0024-3795en
dc.description.abstractWe consider the problem of reconstructing the characteristic polynomial of a graph from its polynomial deck, i.e. the collection of characteristic polynomials of its vertex-deleted subgraphs. Here we provide a positive answer to this problem for graphs as in the title, provided they are disconnected. Since the same problem for connected graph was already answered in positive, we have arrived at the positive answer for the entire collection of graphs under considerations.en
dc.publisherElsevier-
dc.relationSerbian Ministry of Science, Projects 144015D and 144032D-
dc.relation.ispartofLinear Algebra and Its Applicationsen
dc.subject(generalized) line graph | Characteristic polynomial | Disconnected graph | Exceptional graph | Reconstructionen
dc.titleOn the polynomial reconstruction of graphs whose vertex-deleted subgraphs have spectra bounded from below by -2en
dc.typeArticleen
dc.identifier.doi10.1016/j.laa.2007.10.025en
dc.identifier.scopus2-s2.0-39649089172en
dc.relation.firstpage1865en
dc.relation.lastpage1873en
dc.relation.issue8-9en
dc.relation.volume428en
dc.description.rankM22-
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
Show simple item record

SCOPUSTM   
Citations

7
checked on Nov 27, 2022

Page view(s)

13
checked on Nov 28, 2022

Google ScholarTM

Check

Altmetric

Altmetric


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