Name
Abstract | ||
|---|---|---|
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]. |
Year | Venue | Keywords |
|---|---|---|
2008 | Quantum Information & Computation | entangled edge,direct proof,combinatorial proof,entanglement,quantum information |
Field | DocType | Volume |
Multipartite entanglement,Discrete mathematics,Combinatorics,Vertex (geometry),Cycle graph,Combinatorial proof,Graph state,Multiple edges,Conjecture,Mathematics,Direct proof | Journal | 8 |
Issue | ISSN | Citations |
6 | 1533-7146 | 0 |
PageRank | References | Authors |
0.34 | 1 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hadi Rahiminia | 1 | 0 | 0.68 |
| Massoud Amini | 2 | 13 | 2.84 |