Abstract: A directed graph with vertices and e arcs, no self-loops, and no more than one arc directed from any vertex to any vertex , is numbered by assigning to each vertex a distinct element from the set = {1, 2,..., +1}. An arc (, ) from vertex to vertex is numbered (, )= () − () mod ( + 1), where () and () are the values assigned to and . A labelling is a graceful labelling if all (, ) are distinct. If a digraph admits a graceful labelling, then is a graceful digraph. In this note we have studied some observations on graceful directed trees.
Publication Year: 2003
Publication Date: 2003-06-01
Language: en
Type: article
Access and Citation
Cited By Count: 1
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot