On deciding switching equivalence of graphs

Charles J. Colbourn, Derek G. Corneil

Research output: Contribution to journalArticlepeer-review

21 Scopus citations


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 languageEnglish (US)
Pages (from-to)181-184
Number of pages4
JournalTopics in Catalysis
Issue number3
StatePublished - 1980
Externally publishedYes

ASJC Scopus subject areas

  • Catalysis
  • General Chemistry


Dive into the research topics of 'On deciding switching equivalence of graphs'. Together they form a unique fingerprint.

Cite this