H-Irregularity Total Strength of Fan Graphs

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 <?CDATA $ths(G,H)\ge \max \{\lceil 1+\frac{{m}_{1}-1}{|V(H/{S}_{1})|+|E(H/{S}_{1})|}\rceil, \ldots, \lceil 1+\frac{{m}_{1}-1}{|V(H/{S}_{z})|+|E(H/{S}_{z})|}\rceil \}$?> 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 cove

Access to Document

Other files and links

• Link to publication in Scopus
• Open Access Version Available

Fingerprint