Accurate Hub Number of Graphs

摘要

Let G be a graph. A hub set S of a graph G is an accurate hub set of G if VS does not contain a hub set of cardinality |S|. Minimum cardinality of an accurate hub set is called accurate hub number of G and it is denoted by h_a(G). Maximum cardinality of a minimal accurate hub set is called upper accurate hub number of G and it is denoted by H_a (G). In this paper, the accurate hub number for several classes of graphs is computed; bounds in terms of other graph parameters are also determined.