Propagating Graceful Graphs and Trees
Keneth Adrian Dagal, Kristoffer Karan Hugo

TL;DR
This paper explores methods to propagate graceful graphs and trees to better understand their adjacency matrices, providing algorithms aimed at advancing the proof of the Graceful Tree Conjecture.
Contribution
It introduces algorithms for propagating graceful graphs and trees, offering new tools to analyze their structural properties in relation to the conjecture.
Findings
Algorithms for propagating graceful graphs and trees
Insights into graph behavior via adjacency matrices
Potential progress towards the Graceful Tree Conjecture
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · graph theory and CDMA systems · Advanced Graph Theory Research
