On hubtic and restrained hubtic of a graph

Khalaf, Shadi Ibrahim; Mathad, Veena

dc.contributor.author	Khalaf, Shadi Ibrahim	en_US
dc.contributor.author	Mathad, Veena	en_US
dc.date.accessioned	2020-11-04T10:02:12Z
dc.date.available	2020-11-04T10:02:12Z
dc.date.issued	2019-05-07
dc.identifier.citation	Khalaf, S. I. & Mathad, V. (2019). On hubtic and restrained hubtic of a graph. TWMS Journal of Applied and Engineering Mathematics, 9(4), 930-935.	en_US
dc.identifier.issn	2146-1147
dc.identifier.issn	2587-1013
dc.identifier.uri	https://hdl.handle.net/11729/2784
dc.identifier.uri	http://jaem.isikun.edu.tr/web/index.php/archive/103-vol9no4/481
dc.description.abstract	In this article, the hubtic number of the join and corona of two connected graphs is computed. The restrained hubtic number ξr(G) of a graph G is the maximum number such that we can partition V (G) into pairwise disjoint restrained hub sets. We compute the restrained hubtic number of some standard graphs. Some bounds for ξr(G) are obtained.	en_US
dc.description.sponsorship	The second author is partially supported by UGC financial assistance under no. F.510/12/DRS-II/2018(SAP-I).	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	Hub number	en_US
dc.subject	Hubtic number	en_US
dc.subject	Restrained hubtic number	en_US
dc.title	On hubtic and restrained hubtic of a graph	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	9
dc.identifier.issue	4
dc.identifier.startpage	930
dc.identifier.endpage	935
dc.peerreviewed	Yes	en_US
dc.publicationstatus	Published	en_US
dc.relation.publicationcategory	Makale - Uluslararası Hakemli Dergi - Başka Kurum Yazarı	en_US