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/740
DC FieldValueLanguage
dc.contributor.authorStanić, Zoranen_US
dc.date.accessioned2022-08-15T15:00:13Z-
dc.date.available2022-08-15T15:00:13Z-
dc.date.issued2022-
dc.identifier.issn01266705en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/740-
dc.description.abstractWe consider the problem of reconstructing the characteristic polynomial of a signed graph from the collection of characteristic polynomials of its vertex-deleted subgraphs. We resolve this problem for several classes of (signed) graphs including particular subclasses of signed graphs with pendant vertices, signed bundles, bicyclic signed graphs without pendant vertices and signed graphs with at most 8 vertices.en
dc.publisherSpringeren_US
dc.relation.ispartofBulletin of the Malaysian Mathematical Sciences Societyen_US
dc.subjectBicyclic signed graphen
dc.subjectBipartite graphen
dc.subjectCharacteristic polynomialen
dc.subjectPendant vertexen
dc.subjectSigned bundleen
dc.subjectVertex-deleted subgraphen
dc.titleNotes on the Polynomial Reconstruction of Signed Graphsen_US
dc.typeArticleen_US
dc.identifier.doi10.1007/s40840-022-01243-x-
dc.identifier.scopus2-s2.0-85124719725-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/85124719725-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.issn0126-6705en_US
dc.description.rankM21en_US
dc.relation.firstpage1301en_US
dc.relation.lastpage1314en_US
dc.relation.volume45en_US
dc.relation.issue3en_US
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
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

1
checked on Jun 12, 2025

Page view(s)

19
checked on Jan 19, 2025

Google ScholarTM

Check

Altmetric

Altmetric


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