HUB-INTEGRITY OF SPLITTING GRAPH AND DUPLICATION OF GRAPH ELEMENTS

SULTAN SENAN MAHDE, VEENA MATHAD

[PDF]

Abstract

The hub-integrity of a graph G = (V (G);E(G)) is denoted as HI(G) and dened by HI(G) = minfjSj + m(G S); S is a hub set of Gg, 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.

Keywords

integrity, hub-integrity, splitting graph, duplication graph.