Hull number: P5-free graphs and reduction rules

Julio Araujo 1, 2 Gregory Morel 2 Leonardo Sampaio 3 Ronan Soares 1, 2 Valentin Weber 4
2 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
4 G-SCOP_ROSP - ROSP
G-SCOP - Laboratoire des sciences pour la conception, l'optimisation et la production
Abstract : In this paper, we study the (geodesic) hull number of graphs. For any two vertices $u,v\in V$ of a connected undirected 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 \subseteq V$, let $I[S]= \bigcup_{u,v\in S} I[u,v]$. A subset $S\subseteq V$ is (geodesically) convex if $I[S] = S$. Given a subset $S\subseteq 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)$. First, we show a polynomial-time algorithm to compute the hull number of any $P_5$-free triangle-free graph. Then, we present four reduction rules based on vertices with the same neighborhood. We use these reduction rules to propose a fixed parameter tractable algorithm to compute the hull number of any graph $G$, where the parameter can be the size of a vertex cover of $G$ or, more generally, its neighborhood diversity, and we also use these reductions to characterize the hull number of the lexicographic product of any two graphs.
Document type :
Conference papers
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/hal-00799868
Contributor : Julio Araujo <>
Submitted on : Tuesday, March 12, 2013 - 5:02:20 PM
Last modification on : Monday, April 8, 2019 - 10:29:33 AM
Long-term archiving on : Monday, June 17, 2013 - 12:27:33 PM

File

hull2-LAGOS-corrected-ENDM-new...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00799868, version 1

Citation

Julio Araujo, Gregory Morel, Leonardo Sampaio, Ronan Soares, Valentin Weber. Hull number: P5-free graphs and reduction rules. VII Latin-American Algorithms, Graphs and Optimization Symposium (LAGOS), Apr 2013, Playa del Carmen, Mexico. ⟨hal-00799868⟩

Share

Metrics

Record views

650

Files downloads

171