Heptagonal Graceful Labeling of Star Related Graphs
Palabras clave:
Graceful labeling, Graceful graphs, Polygonal graceful labeling, Heptagonal graceful number, Heptagonal graceful labeling, Heptagonal graceful graphsResumen
Numbers of the form (5n2-3n)/2 for all n ≥ 1 are called heptagonal numbers. Let G be a graph with p vertices and q edges. Let f:V(G)→{0,1,2,…,N_q } where Nq is the qth heptagonal number be an injective function. Define the f*:E(G)→{1,7,18,…,Nq } such that f* (uv)=|f(u)-f(v)| for all edges uv∈E(G). If f*(E(G)) is a sequence of distinct consecutive numbers N1,N2,….,Nq then the function f is said to be heptagonal graceful labeling and the graph which admits such a labeling is called a heptagonal graceful graph. In this paper heptagonal graceful labeling of some graphs is studied.
Descargas
Publicado
Cómo citar
Número
Sección
Licencia
Derechos de autor 2023 KEPES

Esta obra está bajo una licencia internacional Creative Commons Atribución-NoComercial-CompartirIgual 4.0.


