Universal α-graceful Gear related Graphs
K. Jadeja Divya, V. J. Kaneria · 2020
A graph or a graceful labeling is called α-labeling if there is a non-negative integer. A vertex is called an extreme vertex if there is an α- gracefule labeling. A graph is called a universal α-graceful graph if all of its vertices are extreme. This chapter provides a universal α-graceful graph such that the graph is obtained by taking duplication of a vertex of gear graph whose degree is two. The graph obtained by 2-super subdivision of all the rim edges is a universal α-graceful graph. The chapter considers a simple, finite and undirected graph with a set of vertices.