Propagating Graceful Graphs and Trees

2021/05/03 by Keneth Adrian P. Dagal, Dagal, Keneth Adrian, Kristoffer Karan Hugo +1
Computer Science · Engineering · #Advanced Graph Theory Research #FOS: Mathematics #General Mathematics (math.GM) #Graph Labeling and Dimension Problems #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2105.01514

openalex publication_date 2021/05/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In an attempt to prove the Graceful Tree Conjecture, we present two propagation of graphs. The first is to propagate graceful graphs, and the second is to propagate trees from a gracefully labeled tree. The motivation in propagating such graphs is to see how graphs behave in the lens of their adjacency matrices. Thus, we provide the necessary algorithms for the said objectives.

Related

• A Computational Approach to the Graceful Tree Conjecture
• A complete proof of The Graceful Tree Conjecture using the concept of Edge Degree
• Graceful and Prime Labelings -- Algorithms, Embeddings and Conjectures
• Growing Graceful and Harmonious Trees
• The Graceful Tree Conjecture: a class of graceful diameter-6 trees