Recognizing locally equivalent graphs

DOI10.1016/0012-365X(93)90357-YzbMATH Open0788.05081WikidataQ126556893 ScholiaQ126556893MaRDI QIDQ685658FDOQ685658

Authors: André Bouchet 

Publication date: 24 October 1993

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

Recommendations

• An efficient algorithm to recognize locally equivalent graphs
• Transitivity of local complementation and switching on graphs.
• scientific article; zbMATH DE number 26598
• scientific article; zbMATH DE number 1086495
• scientific article

zbMATH Keywords

polynomial algorithmsimple graphlocally equivalent graphs

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (16)

• Multiparty entanglement in graph states
• The nullity theorem for principal pivot transform
• Graph states and the variety of principal minors
• An efficient algorithm to recognize locally equivalent graphs
• Quantum stabilizer codes, lattices, and CFTs
• Symmetry constraints on temporal order in measurement-based quantum computation
• Transforming graph states using single-qubit operations
• Shor–Laflamme distributions of graph states and noise robustness of entanglement
• Counting single-qubit Clifford equivalent graph states is \#\(\mathbb{P}\)-complete
• Partial complementation of graphs
• A complete characterization of all-versus-nothing arguments for stabilizer states
• Direct evaluation of pure graph state entanglement
• Title not available (Why is that?)
• Subgraph complementation
• Color-reversal by local complementation
• Title not available (Why is that?)

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)