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 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
