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/768
DC FieldValueLanguage
dc.contributor.authorSimić, Slobodan K.en_US
dc.contributor.authorStanić, Zoranen_US
dc.date.accessioned2022-08-15T15:00:16Z-
dc.date.available2022-08-15T15:00:16Z-
dc.date.issued2016-01-01-
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/768-
dc.description.abstractThe polynomial reconstruction problem for simple graphs has been considered in the literature for more than forty years and is not yet resolved except for some special classes of graphs. Recently, the same problem has been put forward for signed graphs. Here, the reconstruction of the characteristic polynomial of signed graphs whose vertex-deleted subgraphs have least eigenvalue greater than -2 is considered.en
dc.relation.ispartofElectronic Journal of Linear Algebraen
dc.subjectCharacteristic polynomialen
dc.subjectEigenvaluesen
dc.subjectExceptional graphen
dc.subjectNumerical computationen
dc.subjectSigned graphen
dc.subjectSigned line graphen
dc.titlePolynomial reconstruction of signed graphs whose least eigenvalue is close to -2en_US
dc.typeArticleen_US
dc.identifier.doi10.13001/1081-3810.3245-
dc.identifier.scopus2-s2.0-85032126491-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85032126491-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.firstpage740en
dc.relation.lastpage753en
dc.relation.volume31en
dc.relation.issue1en
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

3
checked on Nov 15, 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.