Some results on the edge hub-integrity of graphs (Q345219)
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 6658446
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some results on the edge hub-integrity of graphs |
scientific article; zbMATH DE number 6658446 |
Statements
Some results on the edge hub-integrity of graphs (English)
0 references
1 December 2016
0 references
Summary: The edge hub-integrity of a graph is given by the minimum of \(|S|+m(G-S)\), where \(S\) is an edge hub set and \(m(G-S)\) is the maximum order of the components of \(G-S\). This paper discusses edge hub-integrity of splitting graph and duplication of an edge by vertex and duplication of a vertex by an edge of some graphs.
0 references
edge integrity
0 references
edge hub-integrity
0 references
splitting graph
0 references
duplication graph
0 references
0.9284078478813172
0 references
0.8847459554672241
0 references
0.8581199645996094
0 references
0.8454726338386536
0 references
0.8354718089103699
0 references
