On the hull number of some graph classes

• Authors: J. Araujo;V. Campos;F. Giroire;N. Nisse;L. Sampaio;R. Soares
• Venue: Theoretical Computer Science
• Year: 2013

In this paper, we study the geodetic convexity of graphs, focusing on the problem of the complexity of computing a minimum hull set of a graph in several graph classes. For any two vertices u,v@?V of a connected graph G=(V,E), the closed interval I[u,v] of u and v is the set of vertices that belong to some shortest (u,v)-path. For any S@?V, let I[S]=@?"u","v"@?"SI[u,v]. A subset S@?V is geodesically convex or convex if I[S]=S. In other words, a subset S is convex if, for any u,v@?S and for any shortest (u,v)-path P, V(P)@?S. Given a subset S@?V, the convex hull I"h[S] of S is the smallest convex set that contains S. We say that S is a hull set of G if I"h[S]=V. The size of a minimum hull set of G is the hull number of G, denoted by hn(G). The Hull Number problem is to decide whether hn(G)@?k, for a given graph G and an integer k. Dourado et al. showed that this problem is NP-complete in general graphs. In this paper, we answer an open question of Dourado et al. (2009) [1] by showing that the Hull Number problem is NP-hard even when restricted to the class of bipartite graphs. Then, we design polynomial-time algorithms to solve the Hull Number problem in several graph classes. First, we deal with the class of complements of bipartite graphs. Then, we generalize some results in Araujo et al. (2011) [2] to the class of (q,q-4)-graphs and to cacti. Finally, we prove tight upper bounds on the hull numbers. In particular, we show that the hull number of an n-node graph G without simplicial vertices is at most 1+@?3(n-1)5@? in general, at most 1+@?n-12@? if G is regular or has no triangle, and at most 1+@?n-13@? if G has girth at least 6.