Rizka Asta Amalia Parwati, Purwanto
When G is a graph, its set of vertices is denoted by V (G) and its set of edges is denoted by E(G). Let G be a graph with E(G) = q edges. An elegant labeling of graph G is an injection f, where f:V (G) 0,1,2,...q, such that it induces edge labels f *(uv)= f (u)+ f (v)(mod(q + 1)), for all uv E(G), are non zero and distinct. If there exists an elegant labeling for graph G, then G is elegant. In this paper, we prove that tadpole graph T(n,1), where n 3, n is odd, and tadpole graph T (4n,2), where n is nonnegative integer, are elegant. © 2023 American Institute of Physics Inc.. All rights reserved.
Department of Mathematics, Universitas Negeri, Malang Jalan Semarang 5, Malang, Jawa Timur, 65145, Indonesia