Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2109.09511

A Graceful Algebraic Function Labelling of Rooted Symmetric Trees

Rafael I. Rofa
View original source ↗Read source document ↗Export metadata ↓

Abstract

Let T=(V,E) be a tree with vertex set V and edge set E. A graceful labelling f of T is an injective function f from V into {0, 1, ..., |E|} such that if edge uv is assigned the label g(uv)=|f(u)-f(v)| then the function g from E into {1, ..., |E|} is also injective (that is all edge labels are distinct). A rooted symmetric tree is a tree in which all vertices at the same level from root vertex have the same degree. It has been known since 1979 that rooted symmetric trees are graceful. However, the proofs that have been presented for this fact are either indirect inductive proofs or algorithmic descriptive proofs showing the many separate steps involved in labelling the vertices. Given a rooted symmetric tree, we find a graceful labelling f of T in the form of a direct algebraic function that algebraically maps each vertex of T to a unique label. Interestingly, f turns out to be a generalisation of the way a path is canonically gracefully labelled as algorithmically described by A. Rosa who is a pioneer in this field of research. The algebraic function that defines the graceful labelling is used to show that a class of rooted symmetric trees that contains the class of binomial trees has weakly {\alpha}-labelling and it can provide a concise practical, computational way of producing graceful labelling of large rooted symmetric trees in, relatively, minimal time.

Explore related subjects

math.GM

Keep this discovery

BibTeXRIS

Rafael I. Rofa. 2021-09-15. A Graceful Algebraic Function Labelling of Rooted Symmetric Trees. https://arxiv.org/abs/2109.09511

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗
arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗