Calculating concentratable entanglement in graph states

We propose a method to calculate the purity of reduced states of graph states entirely within the stabilizer formalism, using only the stabilizer generators for a given state. We apply this method to find the concentratable entanglement of graph states, with examples including a single qubit within any graph state, states proposed for use in quantum repeaters, and states that maximize and minimize the overall concentratable entanglement.