The graceful labeling of Vee graphs

Graph labeling is the process of assigning numerical values, typically integers, to the elements of a graph. This study focuses on a specific type of labeling called graceful labeling. In graceful labeling, each vertex of the graph is assigned a unique number such that the differences between these numbers assigned to the end vertices of each edge result in unique values. This article introduces a new graph structure called the Vee graph, which is formed by attaching two grid graphs at one of their corresponding end edges. We demonstrate that the Vee graph can be labeled gracefully, meaning that it satisfies the criteria of graceful labeling. Additionally, the paper provides examples to illustrate graceful labeling for different variations of Vee graphs.

کلیدواژه ها:

Graceful Labeling ، Graph Labeling ، Graph Structure ، Grid Graph ، Vee Graphs