On the Minimum Degree up to Local Complementation: Bounds and Complexity

Abstract : The local minimum degree of a graph is the minimum degree reached by means of a series of local complementations. In this paper, we investigate on this quantity which plays an important role in quantum computation and quantum error correcting codes. First, we show that the local minimum degree of the Paley graph of order p is greater than sqrt{p} - 3/2, which is, up to our knowledge, the highest known bound on an explicit family of graphs. Probabilistic methods allows us to derive the existence of an infinite number of graphs whose local minimum degree is linear in their order with constant 0.189 for graphs in general and 0.110 for bipartite graphs. As regards the computational complexity of the decision problem associated with the local minimum degree, we show that it is NP-complete and that there exists no k-approximation algorithm for this problem for any constant k unless P = NP.
Complete list of metadatas

Contributor : Mehdi Mhalla <>
Submitted on : Tuesday, January 21, 2014 - 8:14:33 AM
Last modification on : Friday, October 25, 2019 - 2:00:40 AM

Links full text




Jérôme Javelle, Mehdi Mhalla, Simon Perdrix. On the Minimum Degree up to Local Complementation: Bounds and Complexity. WG 2012 - International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2012, Jerusalem, Israel. pp.138-147, ⟨10.1007/978-3-642-34611-8_16⟩. ⟨hal-00933720⟩



Record views