The polynomial reconstruction of unicyclic graphs is unique
- 1 January 2007
- journal article
- research article
- Published by Taylor & Francis in Linear and Multilinear Algebra
- Vol. 55 (1) , 35-43
Abstract
We consider the problem of reconstructing the characteristic polynomial of a graph G from its polynomial deck, i.e. the collection of characteristic polynomials of its vertex-deleted subgraphs. Here we provide a positive solution for all unicyclic graphs.Keywords
This publication has 4 references indexed in Scilit:
- Polynomial reconstruction and terminal verticesLinear Algebra and its Applications, 2002
- On the reconstruction of the characteristic polynomial of a graphDiscrete Mathematics, 2000
- The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complementsThe Electronic Journal of Combinatorics, 2000
- Computing the Characteristic polynomial of a graph1974