Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-16T18:14:41.479Z Has data issue: false hasContentIssue false

Unicyclic Graphs Satisfy Harary′s Conjecture

Published online by Cambridge University Press:  20 November 2018

E. Arjomandi
Affiliation:
Department of Computer Science, University of Toronto, Toronto, Canada
D. G. Corneil
Affiliation:
Department of Computer Science, University of Toronto, Toronto, Canada
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Ulam in [7] has conjectured that any graph G with p≥3 nodes is uniquely reconstructable from its collection of subgraphs Gi=G-vi, i=1,2, … p. This conjecture has been proved for various finite graphs including regular, Eulerian, unicyclic, separable, trees and cacti. Since Ulam′s conjecture seems difficult to prove or disprove, some authors have tried to strengthen the conjecture [3]. One of these stronger conjectures is Harary′s conjecture [2].

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1974