GRACEFUL LABELING GRAPH K4 X Pn (n≤ 5)

(Pelabelan Graceful pada Graf K4 X Pn untuk n≤ 5)

Mukayis, Harry Maulana Buhari

Mathematics Department

Faculty of Mathematics and Natural Sciences

Hasanuddin University

ABSTRACT

Keyword:

1. INTRODUCTION Formally, given

a graph G = (V,E) a vertex labelling
1.1 Background
is
In mathematics, graph theory is the
a function of V to a set of labels, a
study of graphs, which are
graph with such a function defined is
mathematical structures used to
called
model pairwise relations between
a vertex-labeld graph. Likewise, an
objects. A graph in this context is
edge labelling is a function of E to a
made up of vertices which are
set
connected by edges. A graph
of labels. In this case, the graph is
labelling is the assignment of labels,
called an edge-labeled graph.
traditionally represented by integers,
Most graph labellings trace their
to edges and/or vertices of a graph.
origins to labellings presented by
 Alexander Rosa in his 1967 paper.  V is the vertex set whose
Rosa identified three types of elements are the vertices, or
labellings, which he called α, β-, and nodes of the graph. This set is
ρ- labellings. β labellings were later often denoted V(G) or just V
renamed as “graceful” by Solomon  E is the edge set whose
golomb and the name has been elements are the edges, or
popular since. connections between vertices
Graceful labelling is one of the of the graph. This set is often
interesting topics in graph theory. denoted E(G) or just E.
Let G(V,E) is a graph. The injective
2.2 Path
mapping f:V→{0,1,…..,|E(G) :
where E(G) is the number of edges A path is a trail im which all vertices
from graph G} is called graceful if (except perhaps the first and last
the weight of edge w(uv) = |f(u)-f(v)| ones are distinct)
are all different for every edge uv.
In this paper, graph will be
labelling graceful is product graph of
K4 x Pn for n n ≤ 5
1.2 problem formulation Path : V1→ V2→…..→ Vn

How to labelling graceful on graph 2.3 Complete graph

K4 x Pn for n ≤ 5
A complete graph is a graph in which
1.3 Research objectives each pair of graph vertices is
Can to specify labelling graceful connected by an edge. The complete
on graph K4 x Pn graph with n graph vertices is

2. THEORETICAL STUDY n(n−1)

denoted Kn and has |E| =
2
2.1 Definition of graph
undirected edges.
A graph is an ordered pair G = (V,E)
2.4 Product of graph
where,
In mathematics, a graph product is a
binary operation on graphs.
Spesififically, it is an operation that So, that the product of that vertex
takes two graphs G1 and G2 and is
produces a graph H with the
V(K4 X P2) = V(K4) X V(P2)
following properties :
= {au,av,bu,bv,cu,cv,du,dv}
 The vertex set of H is the
And for the product set of edges
Cartesian product V(G1) x
given by
V(G2), where V(G1) and
V(G2) are the vertex set of G1 Let e is set of edges from A

and G2, respectively X B if e = (U i,Vj)(Uk,VL) on

condition that if i=k then V jVL €
 Two vertices (u1,u2) and
E(B) and if j = L then UiUk €
(v1,v2) of H are connected by
E(G)
an edge if and only if the
From set of vertex V(K4 X P2), for
vertices u1,u2,v1,v2 satisfy a
e = (au)(bu), since u=u then ab €
condition that takes into
E(K4), but for e = (au)(bv) non-
account the edges of G1 and
adjacentbecause no elemenets are the
G2.
same
Let two of graphs is A and B, the
following set of vertex 3. RESEARCH METHODOLOGY

A={U1,U2,…..,Um} This research is a theoretical study

B={V1,V2,…..,Vn} using descriptive methods by

analysing theories.
So, that the product of that vertex
3.1 Types of Research
is

V(A X B) = V(A) X V(B) 4. RESULT AND DISCUSSION

={Ui,Vj | Ui € V(A) , Vj €
V(B)} 5. CONCLUSION

Let A is K4 and B is P2, the set

of vertex DAFTAR PUSTAKA
K4={a,b,c,d} A.Gallian.A Dynamic Survey of Graph
P2={u,v} Labelling, The Electronic Journal of
 Combinatorics. Twelfth edition Journal of Physic: Confrens Series
published: January 31, 2009. 855 012004
University of Minnesota Duluth.
Agustin, I.H. 2017. On H-Irregulerity Chartrand, Gary. 2005. Introduction To

Strengh Graph: A New Notion. Graph Theory. Singapore : Phing

Zhang