On the total H-irregularity strength of graphs: A new notion

IOP Conf. Series: Journal of Physics: Conf. Series 855 (2017) 012004

Saved in:
Bibliographic Details
Main Authors: Agustin, Ika Hesti (Author), Dafik, Dafik (Author), Marsidi, Marsidi (Author), Albirri, Ermita Rizki (Author)
Format: Academic Paper
Published: 2018-02-28T02:51:12Z.
Subjects:
Online Access:Get Fulltext
Tags: Add Tag
No Tags, Be the first to tag this record!
LEADER 01998 am a22002653u 4500
001 repository_unej_123456789_84424
042 |a dc 
100 1 0 |a Agustin, Ika Hesti  |e author 
500 |a 1742-6588 
500 |a http://repository.unej.ac.id/handle/123456789/84424 
700 1 0 |a Dafik, Dafik  |e author 
700 1 0 |a Marsidi, Marsidi  |e author 
700 1 0 |a Albirri, Ermita Rizki  |e author 
245 0 0 |a On the total H-irregularity strength of graphs: A new notion 
260 |c 2018-02-28T02:51:12Z. 
520 |a IOP Conf. Series: Journal of Physics: Conf. Series 855 (2017) 012004 
520 |a A total edge irregularity strength of G has been already widely studied in many papers. The total -labeling is said to be a total edge irregular -labeling of the graph G if for every two di erent edges e 1 and e 2 , it holds w(e 1 ) 6 = w(e ), where w(uv) = f(u) +f(uv) +f(v), for e = uv. The minimum for which the graph G has a total edge irregular -labeling is called the total edge irregularity strength of G, denoted by tes(G). A natural extension of this concept is by considering the evaluation of the weight is not only for each edge but we consider the weight on each subgraph H G. We extend the notion of the total -labeling into a total H-irregular -labeling. The total -labeling is said to be a total H-irregular -labeling of the graph G if for H G, the total H-weights W(H) = P 2 v2V (H) f(v) + P f(e) are distinct. The minimum for which the graph G has a total H-irregular -labeling is called the total e2E(H) H-irregularity strength of G, denoted by tHs(G). In this paper we initiate to study the tHs of shackle and amalgamation of any graphs and their bound. 
546 |a en 
690 |a Total a-labeling 
690 |a Total H-irregularity strength 
690 |a shackle of any graph 
690 |a amalgamation of any graph 
655 7 |a Article  |2 local 
787 0 |n http://repository.unej.ac.id/handle/123456789/84424 
856 4 1 |u http://repository.unej.ac.id/handle/123456789/84424  |z Get Fulltext