A graph labeling is an assignment of integers to the vertices or edges, or both, subject to
certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening …

Abstract A (p, q)-graph G=(V, E) is said to be strongly k-indexable if it admits a strong k-
indexer viz., an injective function ƒ: V→{0, 1, 2,…, p− 1} such that ƒ (x)+ ƒ (y)= ƒ+(xy) …

A graph labeling is an assignment of integers to the vertices, edges, or to both, and it is
subject to certain conditions. In this paper, a new concept of graph labeling called binary …

Broadcasting is a fundamental problem in the information dissemination area. In classical
broadcasting, a message must be sent from one network member to all other members as …

A digraph D with e arcs is numbered by assigning a distinct integer value θ(v) from {0,1,⋯,e\}
to each node v. The node values, in turn, induce a value θ(u,v) on each arc (u,v) where …

In this paper, we prove that the n-cube is graceful, thus answering a conjecture of J.-C.
Bermond and Gangopadhyay and Rao Hebbare. To do that, we introduce a special kind of …

This paper takes a close look at graceful labelling and its applications. We pay special
attention to the famous Graceful Tree Conjecture, which has attracted a lot of interest and …

Construction of Certain Infinite Families of Graceful Graphs from a Given Graceful Graph Page
1 Def Sci J, Vol32, No 3, July 1982, pp 231-236 Construction of Certain Infinite Families of …

Koh, Rogers and Tan (Discrete Math. 25 (1979) 141–148) give a method to construct a
bigger graceful tree from two graceful trees. Based upon their results, we give a new …

We generalize staircase codes and tiled diagonal zipper codes, preserving their key
properties while allowing each coded symbol to be protected by arbitrarily many component …