An efficient algorithm to recognize locally equivalent graphs

DOI10.1007/BF01275668zbMath0744.05052OpenAlexW1991844770MaRDI QIDQ1181011

André Bouchet

Publication date: 27 June 1992

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01275668

zbMATH Keywords

locally equivalent

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Transforming graph states using single-qubit operations ⋮ Counting single-qubit Clifford equivalent graph states is #P-complete ⋮ Prime vertex-minors of a prime graph ⋮ AN INTRODUCTION TO ONE-WAY QUANTUM COMPUTING IN DISTRIBUTED ARCHITECTURES ⋮ Recognizing locally equivalent graphs

Cites Work

• Isotropic systems
• Graphic presentations of isotropic systems
• Digraph Decompositions and Eulerian Systems

This page was built for publication: An efficient algorithm to recognize locally equivalent graphs