Some operations in hub-integrity of graphs

MaRDI QIDQ326932zbMATH OpenFDO

Authors Senan Mahde, Veena Mathad

Publication date 12 October 2016

Published in Asia Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL http://apjm.apacific.org/PDFs/2-2-108-123.pdf

zbMATH Keywords

binary operation hub-integrity integrity square graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76) Graph theory (05C99)

Review text

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.

Recommendations

Cited in

(7)

This page was built for publication: Some operations in hub-integrity of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326932)