Recognizing locally equivalent graphs

DOI10.1016/0012-365X(93)90357-YzbMath0788.05081WikidataQ126556893 ScholiaQ126556893MaRDI QIDQ685658

André Bouchet

Publication date: 24 October 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

polynomial algorithmsimple graphlocally equivalent graphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (12)

Symmetry constraints on temporal order in measurement-based quantum computation ⋮ A complete characterization of all-versus-nothing arguments for stabilizer states ⋮ Transforming graph states using single-qubit operations ⋮ Subgraph complementation ⋮ Graph states and the variety of principal minors ⋮ Counting single-qubit Clifford equivalent graph states is #P-complete ⋮ Shor–Laflamme distributions of graph states and noise robustness of entanglement ⋮ The nullity theorem for principal pivot transform ⋮ Direct evaluation of pure graph state entanglement ⋮ Quantum stabilizer codes, lattices, and CFTs ⋮ Multiparty entanglement in graph states ⋮ Partial complementation of graphs

Cites Work

• Distance-hereditary graphs
• Isotropic systems
• Graphic presentations of isotropic systems
• Reducing prime graphs and recognizing circle graphs
• Tutte-Martin polynomials and orienting vectors of isotropic systems
• An efficient algorithm to recognize locally equivalent graphs
• Digraph Decompositions and Eulerian Systems
• Transforming trees by successive local complementations
• Decomposition of Directed Graphs
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Recognizing locally equivalent graphs