On deciding switching equivalence of graphs

Charles J. Colbourn, Derek G. Corneil

Research output: Contribution to journalArticle

20 Scopus citations

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

ASJC Scopus subject areas

  • Catalysis
  • Chemistry(all)

Cite this