Extended results on doubly connected hub number of graphs
The hub set measures the connectivity of any nodes in graphs and the determination of it is found to be NP-complete. This paper deduces several properties and characterize of one such hub parameter, the doubly connected hub number for its value equal to 1 and 2. Moreover, a few bounds and Nordhaus-Gaddum type inequalities are discussed.
Authors
- Puneeth S. Veena Mathad
Publication Details
- Journal
- Open Journal of Discrete Applied Mathematics
- Published
- 2025-04-23
- DOI
- https://doi.org/10.30538/psrp-odam2025.0110
- Primary Topic
- Interconnection Networks and Systems
- Type
- article
- Field-Weighted Citation Impact
- 0.00