Hub-integrity of splitting graph and duplication of graph elements

Mahde, Sultan Senan; Mathad, Veena

dc.contributor.author	Mahde, Sultan Senan	en_US
dc.contributor.author	Mathad, Veena	en_US
dc.date.accessioned	2020-10-08T12:58:43Z
dc.date.available	2020-10-08T12:58:43Z
dc.date.issued	2016-01-08
dc.identifier.citation	Mahde, S. S. & Mathad, V. (2016). Hub-integrity of splitting graph and duplication of graph elements. TWMS Journal of Applied and Engineering Mathematics, 6(2), 289-297.	en_US
dc.identifier.issn	2146-1147
dc.identifier.issn	2587-1013
dc.identifier.uri	https://hdl.handle.net/11729/2599
dc.identifier.uri	http://jaem.isikun.edu.tr/web/index.php/archive/92-vol6no2/258
dc.description.abstract	The hub-integrity of a graph G = (V (G), E(G)) is denoted as HI(G) and defined by HI(G) = min{\|S\| + m(G − S), S 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 splitting graph and duplication of an edge by vertex and duplication of vertex by an edge of some graphs.	en_US
dc.language.iso	eng	en_US
dc.publisher	Işık University Press	en_US
dc.rights	info:eu-repo/semantics/openAccess	en_US
dc.rights	Attribution-NonCommercial-NoDerivs 3.0 United States	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/3.0/us/	*
dc.subject	Integrity	en_US
dc.subject	Hub-integrity	en_US
dc.subject	Splitting graph	en_US
dc.subject	Duplication graph	en_US
dc.title	Hub-integrity of splitting graph and duplication of graph elements	en_US
dc.type	article	en_US
dc.description.version	Publisher's Version	en_US
dc.relation.journal	TWMS Journal of Applied and Engineering Mathematics	en_US
dc.identifier.volume	6
dc.identifier.issue	2
dc.identifier.startpage	289
dc.identifier.endpage	297
dc.peerreviewed	Yes	en_US
dc.publicationstatus	Published	en_US
dc.relation.publicationcategory	Makale - Uluslararası Hakemli Dergi - Başka Kurum Yazarı	en_US