Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
On the Minimum Degree Up to Local Complementation: Bounds and Complexity
verfasst von : Jérôme Javelle, Mehdi Mhalla, Simon Perdrix
Erschienen in: Graph-Theoretic Concepts in Computer Science
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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} - \frac{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
l
-approximation algorithm for this problem for any constant
l
unless
P
=
NP
.