A Note on Reconstructing the Characteristic Polynomial of a Graph

DC Field	Value	Language
dc.contributor.author	Simić, Slobodan	en
dc.date.accessioned	2020-05-01T20:12:52Z	-
dc.date.available	2020-05-01T20:12:52Z	-
dc.date.issued	1992-12-01	en
dc.identifier.issn	0167-5060	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/1189	-
dc.description.abstract	It 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.publisher	Elsevier	-
dc.relation.ispartof	Annals of Discrete Mathematics	en
dc.title	A Note on Reconstructing the Characteristic Polynomial of a Graph	en
dc.type	Article	en
dc.identifier.doi	10.1016/S0167-5060(08)70648-4	en
dc.identifier.scopus	2-s2.0-77957844750	en
dc.relation.firstpage	315	en
dc.relation.lastpage	319	en
dc.relation.issue	C	en
dc.relation.volume	51	en
item.openairetype	Article	-
item.cerifentitytype	Publications	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.fulltext	No Fulltext	-
item.grantfulltext	none	-

13

checked on Dec 6, 2023

28

checked on Dec 7, 2023

Check