98
Views
7
CrossRef citations to date
0
Altmetric
Original Articles

The polynomial reconstruction of unicyclic graphs is unique

&
Pages 35-43 | Received 21 Jun 2005, Published online: 10 Oct 2011

References

  • Cvetković , D . 2000 . On reconstruction of the characteristic polynomial of a graph . Discrete Mathematics , 212 : 45 – 52 .
  • Cvetković , D , Doob , M and Sachs , H . 1995 . Spectra of Graphs -- Theory and Application, , 3rd Edn , Heidelberg–Leipzig : Jonah Ambrosius Barth Verlag .
  • Cvetković , D and Gutman , I . 1975 . The reconstruction problem for characteristic polynomials of graphs . Univerzitet u Beogradu. Publikacije Elektrotehnickog Fakulteta. Serija Matematika , 498–451 : 45 – 48 .
  • Cvetković , D and Ivanov , K . 1988 . “ An example of constructing graph catalogues by interactive programming packages (Serbian) ” . In Proc. XII Symp. Inform. Techn., Sarajevo -- Jahorina , Vol. 2 , 781 – 789 . Sarajevo : University of Sarajevo .
  • Cvetković , D and Lepović , M . 1998 . Seeking counterexamples to the reconstruction conjecture for the characteristic polynomial of graphs and a positive result. . Bulletin, Classe des Sciences Mathématiques et Naturelles, Sciences mathématiques , 116 : 91 – 100 .
  • Cvetković , D and Simić , S . 2005 . “ Graph theoretical results obtained by the support of the expert system graph – an extended survey ” . In Graphs and Discovery, DIMACS Series in Discrete Mathematics & Theoretical Computer Science, American Mathematical Society, 2005 (To appear) Edited by: Fajtlowicz , S , Fowler , P , Hansen , P , Janowitz , M and Roberts , F .
  • Hagos , EM . 2000 . The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements. . The Electronic Journal of Combinatorics , 7
  • Manvel , B . 1969 . “ Reconstruction of unicyclic graph ” . In Proof Techniques in Graph Theory , Edited by: Harary , F . 103 – 107 . New York : Academic Press .
  • Schwenk , AJ . 1974 . “ Computing the characteristic polynomial of a graph ” . In Graphs and Combinatorics , Edited by: Bari , R and Harary , F . 153 – 172 . Berlin–Heidelberg–New York : (Lecture notes in Math. 406), Springer-Verlag .
  • Sciriha , I . 2002 . Polynomial reconstruction and terminal vertices . Linear Algebra and its Applications , 356 : 145 – 156 .
  • Sciriha , I and Formosa , MJ . 2003 . On polynomial reconstruction of disconnected graphs . Utilitas Mathematica , 64 : 33 – 44 .
  • Simić , SK . 1992 . “ A note on reconstructing the characteristic polynomial of a graph ” . In Combinatorics, Graphs and Complexity , Edited by: Nes˘etr˘il , J and Fiedler , M . 315 – 320 . (Proc. of the Fourth Czechoslovakian Symp. on Combinatorics) (Amsterdam: Elsevier Science Publishers B.V.) .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.