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-07-15en
dc.identifier.issn0024-3795en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1118-
dc.description.abstractThe reconstruction problem of the characteristic polynomial of graphs from their polynomial decks was posed in 1973. So far this problem is not resolved except for some particular cases. Moreover, no counterexample for graphs of order n>2 is known. Here we put forward the analogous problem for signed graphs, and besides some general results, we resolve it within signed trees and unicyclic signed graphs, and also within disconnected signed graphs whose one component is either a signed tree or is unicyclic. A family of counterexamples that was encountered in this paper consists of two signed cycles of the same order, one balanced and the other unbalanced.en
dc.publisherElsevier-
dc.relationGraph theory and mathematical programming with applications in chemistry and computer science-
dc.relationGeometry, Education and Visualization With Applications-
dc.relation.ispartofLinear Algebra and Its Applicationsen
dc.subjectCharacteristic polynomial | Eigenvalues | Signed graph | Unicyclic graphen
dc.titlePolynomial reconstruction of signed graphsen
dc.typeArticleen
dc.identifier.doi10.1016/j.laa.2016.03.036en
dc.identifier.scopus2-s2.0-84962019387en
dc.relation.firstpage390en
dc.relation.lastpage408en
dc.relation.volume501en
dc.description.rankM21-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.openairetypeArticle-
item.cerifentitytypePublications-
item.grantfulltextnone-
item.fulltextNo Fulltext-
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-

#### SCOPUSTM Citations

7
checked on Jan 29, 2023

#### Page view(s)

23
checked on Jan 30, 2023