Author:
Hinding Nurdin,Haeruddin ,Haryanto Loeky
Abstract
Abstract
Determine of H-irregularity total strength in all graphs was not complete on graph classes. Research aims to determine algorithm the H-irregularity total of fan graph, with use H-covering, where H isomorfic to. The determination of H-irregularity total strength of fan graph was conducted by determining the greatest lower bound and the smallest upper bound. The lower bound was analysed by using theorem that
t
h
s
(
G
,
H
)
≥
max
{
⌈
1
+
m
1
−
1
|
V
(
H
/
S
1
)
|
+
|
E
(
H
/
S
1
)
|
⌉
,
…
,
⌈
1
+
m
1
−
1
|
V
(
H
/
S
z
)
|
+
|
E
(
H
/
S
z
)
|
⌉
}
while the upper bound was analysed by vertex labeling edge labeling and count weight H-covering. In this paper, we are find of fan graph Fn
, n ≥ 4 with covering-C4
.
Subject
General Physics and Astronomy
Reference5 articles.
1. Graph labeling, Electron;Galian;J. Combin.,2014
2. On irregular total labelings;Baca;Descrete Math.,2007
3. On H-irregularity strength of graphs;Faraha;Graph Theory,2017
4. Semanicova Fenovcikolva, A. On irregularity Strength of diamond network;Hinding;AKCE International Journal of Graph and Combinatorics,2018
5. Total edge irregularity strength of subdivision of star;Hinding;Journal of Discrete Mathemtaical Sciences and Cryptography,2015