1. Research with MATF
  2. MATF
  3. Research outputs
Please use this identifier to cite or link to this item: https://research.matf.bg.ac.rs/handle/123456789/744
DC FieldValueLanguage
dc.contributor.authorSimić, Slobodan K.en_US
dc.contributor.authorStanić, Zoranen_US
dc.date.accessioned2022-08-15T15:00:13Z-
dc.date.available2022-08-15T15:00:13Z-
dc.date.issued2008-04-15-
dc.identifier.issn00243795en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/744-
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. © 2007 Elsevier Inc. All rights reserved.en
dc.relation.ispartofLinear Algebra and Its Applicationsen
dc.subject(generalized) line graphen
dc.subjectCharacteristic polynomialen
dc.subjectDisconnected graphen
dc.subjectExceptional graphen
dc.subjectReconstructionen
dc.titleOn the polynomial reconstruction of graphs whose vertex-deleted subgraphs have spectra bounded from below by -2en_US
dc.typeArticleen_US
dc.identifier.doi10.1016/j.laa.2007.10.025-
dc.identifier.scopus2-s2.0-39649089172-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/39649089172-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.firstpage1865en
dc.relation.lastpage1873en
dc.relation.volume428en
dc.relation.issue8-9en
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
crisitem.author.deptNumerical Mathematics and Optimization-
crisitem.author.orcid0000-0002-4949-4203-
Appears in Collections:Research outputs
Show simple item record

SCOPUSTM   
Citations

10
checked on Nov 8, 2024

Page view(s)

10
checked on Nov 15, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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