Mathad, V. and Khalaf, S.I. and Raikar, V. (2022) Neighborhub number of graphs. TWMS Journal of Applied and Engineering Mathematics, 12 (4). pp. 1349-1355.
![[img]](http://eprints.uni-mysore.ac.in/style/images/fileicons/text.png) |
Text (Full Text)
NEIGHBORHUB NUMBER OF GRAPHS.pdf - Published Version Download (254kB) |
Official URL: http://jaem.isikun.edu.tr/web/index.php/archive/11...
Abstract
Let G be a graph. A neighborhub set (n-hub set) S of G is a set of vertices with the property that for any pair of vertices outside of S, there is a path between them with all intermediate vertices in S and G = S v2S < N[v] >. The neighborhub number(n-hub number) hn(G) is then de ned to be the size of a smallest neighborhub set of G. In this paper, the neighborhub number for several classes of graphs is computed, bounds in terms of other graph parameters are also determined.
| Item Type: | Article |
|---|---|
| Uncontrolled Keywords: | Neighborhood number, Connected neighborhood number, Hub number, Total hub number, Neighborhub number. |
| Subjects: | E Mathematical Science > Mathematics |
| Divisions: | Department of > Mathematics |
| Depositing User: | C Swapna Library Assistant |
| Date Deposited: | 03 Jul 2023 10:04 |
| Last Modified: | 03 Jul 2023 10:04 |
| URI: | http://eprints.uni-mysore.ac.in/id/eprint/17584 |
Actions (login required)
 |
View Item |
