Graph states are special multipartite entangled states that have been proven useful in a variety of quantum information tasks. We address the issue of characterizing and quantifying the genuine multipartite entanglement of graph states up to eight qubits. The entanglement measures used are the geometric measure, the relative entropy of entanglement, and the logarithmic robustness, have been proved to be equal for the genuine entanglement of a graph state. We provide upper and lower bounds as well as an iterative algorithm to determine the genuine multipartite entanglement.
