Some operations in hub-integrity of graphs (Q326932)

Summary: The hub-integrity of a connected graph \(G=(V(G), E(G))\) is denoted as \(\mathrm{HI}(G)\) and defined by \(\mathrm{HI}(G)=\min\{|S|+m(G-S): S \text{ 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 square graph of path as well as we give some results connecting the hub-integrity of binary graph operations.