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/779
DC FieldValueLanguage
dc.contributor.authorSimić, Slobodan K.en_US
dc.contributor.authorStanić, Zoranen_US
dc.date.accessioned2022-08-15T15:00:17Z-
dc.date.available2022-08-15T15:00:17Z-
dc.date.issued2007-01-01-
dc.identifier.issn03081087en
dc.identifier.urihttps://research.matf.bg.ac.rs/handle/123456789/779-
dc.description.abstractWe consider the problem of reconstructing the characteristic polynomial of a graph G from its polynomial deck, i.e. the collection P(G) of characteristic polynomials of its vertex-deleted subgraphs. Here we provide a positive solution for all unicyclic graphs. © 2007 Taylor & Francis.en
dc.relation.ispartofLinear and Multilinear Algebraen
dc.subjectAdjacency matrixen
dc.subjectCharacteristic polynomialen
dc.subjectEigenvaluesen
dc.subjectUnicyclic graphen
dc.titleThe polynomial reconstruction of unicyclic graphs is uniqueen_US
dc.typeArticleen_US
dc.identifier.doi10.1080/03081080500426133-
dc.identifier.scopus2-s2.0-33751180335-
dc.identifier.urlhttps://api.elsevier.com/content/abstract/scopus_id/33751180335-
dc.contributor.affiliationNumerical Mathematics and Optimizationen_US
dc.relation.firstpage35en
dc.relation.lastpage43en
dc.relation.volume55en
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

12
checked on Nov 8, 2024

Page view(s)

16
checked on Nov 15, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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