A Generalization of the Bodendiek Conjecture About Graceful Graphs
C. Zhi-Zeng · 1990
R. Bodendiek conjectured that every graph consisting of a cycle plus a chord is graceful, and various proofs have been given. [1] MHere we use GL-matrix as a tool in proving the following generalization : Apart from four exceptional cases,simple graphs consisting of three independent paths joining two vertices are graceful. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.