A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
HUB-INTEGRITY OF SPLITTING GRAPH AND DUPLICATION OF GRAPH ELEMENTS
2016
App. Eng. Math. V
unpublished
Preserved Fulltext
The hub-integrity of a graph G = (V (G), E(G)) is denoted as HI(G) and defined by HI(G) = min{|S| + m(G − S), S is a hub set of G}, where m(G − S) is the order of a maximum component of G − S. In this paper, we discuss hub-integrity of splitting graph and duplication of an edge by vertex and duplication of vertex by an edge of some graphs.
fatcat:xyfwj3hr6jhlnpianilqcg3oyy