Hub-integrity of splitting graph and duplication of graph elements
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 v...
Saved in:
Published in: | TWMS journal of applied and engineering mathematics 2016-07, Vol.6 (2), p.289 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | 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. |
---|---|
ISSN: | 2146-1147 2146-1147 |