Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 15493 (Why is no real title available?)
- scientific article; zbMATH DE number 4183450 (Why is no real title available?)
- A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
- An efficient algorithm to recognize locally equivalent graphs
- Decomposition of Directed Graphs
- Digraph Decompositions and Eulerian Systems
- Distance-hereditary graphs
- Graphic presentations of isotropic systems
- Isotropic systems
- Reducing prime graphs and recognizing circle graphs
- Transforming trees by successive local complementations
- Tutte-Martin polynomials and orienting vectors of isotropic systems
Cited in
(17)- The nullity theorem for principal pivot transform
- Multiparty entanglement in graph states
- Shor–Laflamme distributions of graph states and noise robustness of entanglement
- Subgraph complementation
- scientific article; zbMATH DE number 1802681 (Why is no real title available?)
- Counting single-qubit Clifford equivalent graph states is \#\(\mathbb{P}\)-complete
- Vertex-minors of graphs: a survey
- Direct evaluation of pure graph state entanglement
- Partial complementation of graphs
- Quantum stabilizer codes, lattices, and CFTs
- Graph states and the variety of principal minors
- Transforming graph states using single-qubit operations
- Symmetry constraints on temporal order in measurement-based quantum computation
- A complete characterization of all-versus-nothing arguments for stabilizer states
- Color-reversal by local complementation
- An efficient algorithm to recognize locally equivalent graphs
- scientific article; zbMATH DE number 808801 (Why is no real title available?)
This page was built for publication: Recognizing locally equivalent graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685658)
