Hull number: $P_5$-free graphs and reduction rules

1 MASCOTTE - Algorithms, simulation, combinatorics and optimization for telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
3 G-SCOP_ROSP - Recherche Opérationnelle pour les Systèmes de Production
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.
Keywords :
Document type :
Reports

Cited literature [13 references]

https://hal.inria.fr/hal-00724120
Contributor : Julio Araujo <>
Submitted on : Friday, August 17, 2012 - 5:07:27 PM
Last modification on : Monday, December 14, 2020 - 3:30:28 PM
Long-term archiving on: : Sunday, November 18, 2012 - 2:35:23 AM

File

RR-8045.pdf
Files produced by the author(s)

Identifiers

• HAL Id : hal-00724120, version 1

Citation

Julio Araujo, Gregory Morel, Leonardo Sampaio, Ronan Soares, Valentin Weber. Hull number: $P_5$-free graphs and reduction rules. [Research Report] RR-8045, INRIA. 2012, pp.10. ⟨hal-00724120⟩

Record views