Please use this identifier to cite or link to this item: https://www.um.edu.mt/library/oar/handle/123456789/77747
Title: On the reconstruction of the characteristic polynomial of a graph.
Authors: Formosa, Juanita (2001)
Keywords: Mathematics
Graphic methods
Polynomials
Issue Date: 2001
Citation: Formosa, J. (2001). On the reconstruction of the characteristic polynomial of a graph (Master's dissertation).
Abstract: A variation of the Reconstruction Conjecture is the Polynomial Reconstruction Conjecture, likewise still open in general. Graph theorists aim to recover the characteristic polynomial of a graph G of order n from the p-deck, PD ( G) of G, consisting of the n characteristic polynomials of the one-vertex-deleted subgraphs (with multiplicities). This conjecture is commonly referred to as Problem D by A. Schwenk.
Description: M.SC.MATHS
URI: https://www.um.edu.mt/library/oar/handle/123456789/77747
Appears in Collections:Dissertations - FacSci - 1965-2014
Dissertations - FacSciMat - 1998-2015

Files in This Item:
File Description SizeFormat 
M.SC.MATHS_Formosa_Juanita_2001.pdf
  Restricted Access
2.65 MBAdobe PDFView/Open Request a copy


Items in OAR@UM are protected by copyright, with all rights reserved, unless otherwise indicated.