Sun–Wang–Yao conjecture on transforming strongly graceful trees into paths

Let TT be a tree with a perfect matching. An edge-mismatched transfer-operation removes an edge uvuv from TT and adds a non-edge xyxy when the edges uvuv and xyxy have the same edge label under a strongly graceful labeling, producing a graph denoted Tuv+xyT-uv+xy. A tree has a strongly graceful labeling when its vertex labels induce the required distinct edge labels and complementary labels on the endpoints of each matching edge. Sun–Wang–Yao's conjecture. Any tree with a perfect matching can be transformed into some path with a perfect matching by a sequence of edge-mismatched transfer-operations such that both the original tree and the resulting path admit strongly graceful labelings. This conjecture proposes a reduction of strongly graceful trees with perfect matchings to paths via the stated operation; its resolution is not established in the supplied source.

Sources & referencesView supporting material

Primary source

Bing Yao, Xiaohui Zhang, Hui Sun, Jing Su, Fei Ma and Hongyu Wang, “Parameterized Colorings And Labellings Of Graphs In Topological Coding”, arXiv:2207.03381 (2022).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.