The joint sum of graceful trees
A graph is called graceful, if there is a labeling \(f\) of its vertices with distinct integers so that the induced edge labeling \(f'\) defined by \(f'(u,v) = | f(u) - f(v) |\) assigns each edge a different label. In 1966 A. Rosa conjectured that any tree is graceful. The present paper defines the concept of joint sum of graceful trees: Two trees \(T\) and \(T'\) define the joint sum of \(T\) and \(T'\) as a new tree by connecting a vertex of \(T\) with a vertex of \(T'\). The paper studies the gracefulness of the joint sum of graceful trees and gives necessary and sufficient conditions for a certain family of trees.
- scientific article; zbMATH DE number 57429
- scientific article; zbMATH DE number 5305238
- Graceful tree conjecture for infinite trees
- Another equivalent of the graceful tree conjecture
- scientific article; zbMATH DE number 36203
- Trees and Power-Sums
- A note on strongly graceful trees.
- scientific article; zbMATH DE number 2235053
- scientific article; zbMATH DE number 398970
- Operations of interlaced trees and graceful trees
This page was built for publication: The joint sum of graceful trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1324364)
