DC FieldValueLanguage
dc.contributor.authorSimić, Slobodanen
dc.contributor.authorStanić, Zoranen
dc.date.accessioned2020-05-01T20:12:46Z-
dc.date.available2020-05-01T20:12:46Z-
dc.date.issued2016-01-01en
dc.identifier.issn1537-9582-
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1121-
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.publisherInternational Linear Algebra Society-
dc.relationGeometry, Education and Visualization With Applications-
dc.relationGraph theory and mathematical programming with applications in chemistry and computer science-
dc.relation.ispartofElectronic Journal of Linear Algebraen
dc.subjectCharacteristic polynomial | Eigenvalues | Exceptional graph | Numerical computation | Signed graph | Signed line graphen
dc.titlePolynomial reconstruction of signed graphs whose least eigenvalue is close to -2en
dc.typeArticleen
dc.identifier.doi10.13001/1081-3810.3245en
dc.identifier.scopus2-s2.0-85032126491en
dc.relation.firstpage740en
dc.relation.lastpage753en
dc.relation.issue1en
dc.relation.volume31en
dc.description.rankM23-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
item.fulltextNo Fulltext-
item.openairetypeArticle-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/174033e.php-
crisitem.project.fundingProgramDirectorate for Computer & Information Science & Engineering-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/Directorate for Computer & Information Science & Engineering/1740333-
Show simple item record

SCOPUSTM   
Citations

3
checked on Jan 21, 2025

Page view(s)

26
checked on Jan 22, 2025

Google ScholarTM

Check

Altmetric

Altmetric


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