DC FieldValueLanguage
dc.contributor.authorSimić, Slobodanen
dc.date.accessioned2020-05-01T20:12:52Z-
dc.date.available2020-05-01T20:12:52Z-
dc.date.issued1992-12-01en
dc.identifier.issn0167-5060en
dc.description.abstractIt is well known that the characteristic polynomial of any graph is determined up to an additive constant from its polynomial deck, i.e. the collection of the characteristic polynomials of the point deleted subgraphs. Here we prove that these constants are equal for any two connected graphs with the same polynomial decks, whenever the spectra of all subgraphs are bounded from below by -2.en
dc.publisherElsevier-
dc.relation.ispartofAnnals of Discrete Mathematicsen
dc.titleA Note on Reconstructing the Characteristic Polynomial of a Graphen
dc.typeArticleen
dc.identifier.doi10.1016/S0167-5060(08)70648-4en
dc.identifier.scopus2-s2.0-77957844750en
dc.relation.firstpage315en
dc.relation.lastpage319en
dc.relation.issueCen
dc.relation.volume51en
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.cerifentitytypePublications-
Show simple item record

SCOPUSTM   
Citations

12
checked on Nov 27, 2022

Page view(s)

12
checked on Nov 28, 2022

Google ScholarTM

Check

Altmetric

Altmetric


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