16 citations · 46 across the 5 of their papers we have counts for
5 papers
On the Minimum Degree up to Local Complementation: Bounds and Complexity
Jérôme Javelle, Mehdi Mhalla, Simon Perdrix
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 impo…
On Weak Odd Domination and Graph-based Quantum Secret Sharing
Sylvain Gravier, Jérôme Javelle, Mehdi Mhalla +1
A weak odd dominated (WOD) set in a graph is a subset B of vertices for which there exists a distinct set of vertices C such that every vertex in B has an odd number of neighbors i…
Optimal accessing and non-accessing structures for graph protocols
Sylvain Gravier, Jérôme Javelle, Mehdi Mhalla +1
An accessing set in a graph is a subset B of vertices such that there exists D subset of B, such that each vertex of V\B has an even number of neighbors in D. In this paper, we int…
Classical versus Quantum Graph-based Secret Sharing
Jérôme Javelle, Mehdi Mhalla, Simon Perdrix
We study a simple graph-based classical secret sharing scheme: every player's share consists of a random key together with the encryption of the secret with the keys of his neighbo…
New Protocols and Lower Bound for Quantum Secret Sharing with Graph States
Jérôme Javelle, Mehdi Mhalla, Simon Perdrix
We introduce a new family of quantum secret sharing protocols with limited quantum resources which extends the protocols proposed by Markham and Sanders and by Broadbent, Chouha, a…