Claim Missing Document
Check
Articles

Found 1 Documents
Search
Journal : Syntax Literate : Jurnal Ilmiah Indonesia

On Edge Irregular Total Labeling Algorithm of Cycle Chain Graph Gradina Nur Fauziah
Syntax Literate Jurnal Ilmiah Indonesia
Publisher : CV. Ridwan Publisher

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (10745.199 KB) | DOI: 10.36418/syntax-literate.v7i6.7369

Abstract

Suppose G=(V,E) is a graph with the vertex set V(G) and edge set E(G) we defined a labeling f:V∪E→{1,2,…,k} to be an edge irregular total k-labeling of graph G if for every two different edge e and f there is wt(e)≠wt(f). The minimum k for which the graph G has an edge irregular total k-labeling is called the total irregularity streghth of the graph G. On this research we found that labeling algorithm of Cycle Chain Graph with n block cycle graph is an edge irregular total labeling