Some operations in hub-integrity of graphs (Q326932)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6637978
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some operations in hub-integrity of graphs |
scientific article; zbMATH DE number 6637978 |
Statements
Some operations in hub-integrity of graphs (English)
0 references
12 October 2016
0 references
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.
0 references
integrity
0 references
hub-integrity
0 references
square graph
0 references
binary operation
0 references
0.873288094997406
0 references
0.8682672381401062
0 references
0.8630406856536865
0 references
0.85086989402771
0 references
0.8454726338386536
0 references
