ACADSTAFF UGM

CREATION
Title : On Total Edge Irregularity Strength of Some Graphs and the Construction of Labeling
Author :

Dr.rer.nat. Yeni Susanti, S.Si., M.Si. (1)

Date : 2019
Keyword : the total edge irregularity strength, snowflake graph, water bears graph, complete star of cycle. the total edge irregularity strength, snowflake graph, water bears graph, complete star of cycle.
Abstract : Let be a simple, connected, and undirected graph, where V(G) is a nonempty vertex set and E(G) is an edge set. Let k be a positive integer. Then a labeling is called an edge irregular total k-labeling if for each two distinct edges have different weight of edges. Furthermore, minimum k for which G has edge irregular total k-labeling is called total edge irregularity strength and denoted by tes(G). In this paper, we will provide the total edge irregularity strength of snowflake graph, water bears graph, and complete star of cycle.
Group of Knowledge : Matematika
Original Language : English
Level : Internasional
Status :
Published
Document
No Title Document Type Action
1 jurnal_ca_2053141_bb1bc654a2d08196226387adc8dd0893.pdf
Document Type : [PAK] Bukti Korespondensi Penulis
[PAK] Bukti Korespondensi Penulis View