Abstract
A graph $G$ on $m$ edges is considered graceful if there is a labelling $f$ of the vertices of $G$ with distinct integers in the set $\{0,1,\dots,m\}$ such that the induced edge labelling $g$ defined by $g(uv)=|f(u)-f(v)|$ is a bijection to $\{1,\dots,m\}$. We here consider some relaxations of these conditions as applied to tree labellings: 1. Edge-relaxed graceful labellings, in which repeated edge labels are allowed, 2. Range-relaxed graceful labellings, in which the upper bound $m'$ is allowed to go higher than the number of edges, and 3. Vertex-relaxed graceful labellings, in which repeated vertex labels are allowed. The first of these had been looked at by Rosa and Širáň (1995). Here some linear bounds in the relevant metrics are given for range-relaxed and vertex-relaxed graceful labellings.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A note on graceful trees;2ND INTERNATIONAL CONFERENCE ON MATHEMATICAL TECHNIQUES AND APPLICATIONS: ICMTA2021;2022
2. A Graceful Labeling of Square of Path Graph with Quadratic Complexity Algorithm;WSEAS TRANSACTIONS ON MATHEMATICS;2021-08-23
3. Almost all trees are almost graceful;Random Structures & Algorithms;2020-02-19
4. Binomial trees are graceful;AKCE International Journal of Graphs and Combinatorics;2020-01-02
5. Construction of an α-labeled tree from a given set of α-labeled trees;AKCE International Journal of Graphs and Combinatorics;2017-08-01