On separability of graphs with some entangled edges
In this paper we give a combinatorial proof of the entanglement of a graph whose number of vertices is a product of two primes. and has exactly one entangled edge, or all of whose entangled edges are emanating from one vertex. Thereby, we provide easier and more direct proof of the conjecture by Braunstein, Ghosh, and Severini in [2].
entanglement laplacian of a graph quantum information