The pivot number f a graph

Abstract

For a graph G having at least one edge, the minimum number of edges which we can remove from G such that the resulting graph has hub number larger than the hub number of G is called the pivot number p{G) of G. The values of pivot number for several classes of graphs are computed, and we determine the pivot number of join and corona products. Also some bounds for this parameter are obtained.