Hub Number of Incidence and Power Graph

In graph theory, a set H \subseteq V (G) is defined as a hub set if every pair of non-adjacent vertices outside H can be interconnected by a path that exclusively traverses through the internal vertices contained in H. The hub number of a graph G refers to the minimal cardinality of such a hub set, providing crucial insights into the structural connectivity of the graph. This paper delves into the exploration of the hub number across various graph structures, specifically focusing on incidence graphs and square graphs, both of which possess unique characteristics impacting their connectivity properties. We establish theoretical bounds for the hub numbers of these graphs, facilitating a clearer understanding of their structural complexities. Furthermore, we derive explicit values for the hub numbers of several special types of graphs, including path graphs, star graphs and complete graphs. Through rigorous analysis and evaluation, this study contributes to the broader field of connectivity in graphs by not only identifying the hub numbers for specific examples but also by proposing methodologies for their computation. These findings have important implications for applications in network design and graph optimization, enhancing the utility of hub sets in practical scenarios.

کلیدواژه ها:

Hub set ، Connected dominating set ، Incidence graph ، Square graph