On hubtic and restrained hubtic of a graph

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.