Syntax Literate: Jurnal Ilmiah Indonesia pï¿½ISSN: 2541-0849 e-ISSN: 2548-1398

Vol. 7, No. 6, Juni 2022

ON EDGE IRREGULAR TOTAL LABELING ALGORITHM OF CYCLE CHAIN GRAPH

Gradina Nur Fauziah

Politeknik Ilmu Pelayaran Makassar, Indonesia

Abstract

Suppose ï¿½is a graph with the vertex set ï¿½and edge set ï¿½we defined a labeling ï¿½to be an edge irregular total labeling of graph ï¿½if for every two different edge ï¿½and ï¿½there is . The minimum ï¿½for which the graph ï¿½has an edge irregular total labeling is called the total irregularity streghth of the graph . On this research we found that labeling algorithm of Cycle Chain Graph with ï¿½block cycle graph is an edge irregular total labeling and

Keywords: edge irregular total labeling, , Cycle Chain Graph

Introduction

A labeling of graph ï¿½with vertex set ï¿½and edge set is a map that carries graph elements to the numbers (usually to the positive or non-negative integer). The most common choices of domain are the set of all vertices (known as vertex labeling), the set of edge (edge labeling), or the set of all vertices and edges (total labeling) (Gallian, 1998).

The sum of all label that associated with a graph elemen is called weight of the elements. (Wallis, 2001) on his book define that the weight of a vertex ï¿½under total labeling ï¿½of element of a graph ï¿½is a

And the weight of edge is

The irregular labeling was first introduced by Chartland, et all in 1986. Suppose