Year: 2025
Type: article
Abstract: 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.
Author: Veena Mathad, Puneeth S.
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4409722675