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 |