PELABELAN GRACEFUL, SKOLEM GRACEFUL DAN PELABELAN PADA GRAF H-BINTANG DAN A-BINTANG

Abstract

The graph G = (V, E) is the ordered set of sets in which V is the set null node and E is a set of arcs. Labeling on graph G is determination of node and arc values or both with certain rules. Labeling graceful is the α α function of the set of vertices V to the set of numbers 0.1,2, .... 𝐸 which induces the α 's bijtive function of the set of arc E to the set number 1,2, .... 𝐸 where each arc uv ∈ E with node u, v ∈ V apply α '(uv) = α (𝑢) - α (𝑣). The graceful grid labeling is a modification of graceful labeling ie the injection function μ from the set of vertices V to the set of numbers 1,2, .... 𝑉 yang induces the μj 's bijtive function of the arc set E to the set of numbers 1,2, .... 𝐸 where each arc uv ∈ E with node u, v ∈ V apply μ '(uv) = μ (𝑢) - μ (𝑣). Labeling ρ is another modification of graceful labeling that is the γ injection function of the set of vertices V to the set of numbers 0.1, 2, .... 𝐸 + 1 which induces the function bitif γ 'from the set of arc E to set of numbers 1,2, .... 𝐸 where each arc uv ∈ E with node u, v ∈ V apply γ '(uv) = γ (𝑢) - γ (𝑣). The H-star chart is formed of the letter H and all its leaves are given a star graph 𝑆𝑛. A-star chart formed from letter A and all its leaves are given a star graph 𝑆𝑛. In this paper is given graceful label construction, graceful scheme and labeling ρ for H-star graphs A-star.