The polynomial reconstruction of unicyclic graphs is unique

DC Field	Value	Language
dc.contributor.author	Simić, Slobodan	en
dc.contributor.author	Stanić, Zoran	en
dc.date.accessioned	2020-05-01T20:12:51Z	-
dc.date.available	2020-05-01T20:12:51Z	-
dc.date.issued	2007-01-01	en
dc.identifier.issn	0308-1087	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/1172	-
dc.description.abstract	We 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.	en
dc.publisher	Taylor & Francis	-
dc.relation.ispartof	Linear and Multilinear Algebra	en
dc.subject	Adjacency matrix \| Characteristic polynomial \| Eigenvalues \| Unicyclic graph	en
dc.title	The polynomial reconstruction of unicyclic graphs is unique	en
dc.type	Article	en
dc.identifier.doi	10.1080/03081080500426133	en
dc.identifier.scopus	2-s2.0-33751180335	en
dc.relation.firstpage	35	en
dc.relation.lastpage	43	en
dc.relation.issue	1	en
dc.relation.volume	55	en
dc.description.rank	M22	-
item.fulltext	No Fulltext	-
item.openairetype	Article	-
item.grantfulltext	none	-
item.cerifentitytype	Publications	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-

12

checked on Apr 3, 2025

22

checked on Jan 31, 2025

Check