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.
Primary Language  English 

Journal Section  Research Article 
Authors 

Publication Date  December 1, 2019 
Published in Issue  Year 2019, Volume 9, Issue 4 
Bibtex  @ { twmsjaem760966, journal = {TWMS Journal of Applied and Engineering Mathematics}, issn = {21461147}, eissn = {25871013}, address = {Işık University ŞİLE KAMPÜSÜ Meşrutiyet Mahallesi, Üniversite Sokak No:2 Şile / İstanbul}, publisher = {Turkic World Mathematical Society}, year = {2019}, volume = {9}, number = {4}, pages = {930  935}, title = {ON HUBTIC AND RESTRAINED HUBTIC OF A GRAPH}, key = {cite}, author = {Khalaf, S. I. and Mathad, V.} } 