Abstract
We prove that the problem of deciding whether two graphs are switching equivalent is polynomial time equivalent to deciding isomorphism of graphs. The implications of this to the analysis of two-graphs are discussed.
Original language | English (US) |
---|---|
Pages (from-to) | 181-184 |
Number of pages | 4 |
Journal | Topics in Catalysis |
Volume | 2 |
Issue number | 3 |
DOIs | |
State | Published - 1980 |
Externally published | Yes |
ASJC Scopus subject areas
- Catalysis
- Chemistry(all)