On deciding switching equivalence of graphs

Charles Colbourn, Derek G. Corneil

Research output: Contribution to journalArticle

20 Citations (Scopus)

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 - 1980
Externally publishedYes

ASJC Scopus subject areas

  • Psychology(all)

Cite this

On deciding switching equivalence of graphs. / Colbourn, Charles; Corneil, Derek G.

In: Topics in Catalysis, Vol. 2, No. 3, 1980, p. 181-184.

Research output: Contribution to journalArticle

Colbourn, Charles ; Corneil, Derek G. / On deciding switching equivalence of graphs. In: Topics in Catalysis. 1980 ; Vol. 2, No. 3. pp. 181-184.
@article{48c2d2d7d9be497f8900f31d3972092b,
title = "On deciding switching equivalence of graphs",
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.",
author = "Charles Colbourn and Corneil, {Derek G.}",
year = "1980",
doi = "10.1016/0166-218X(80)90038-4",
language = "English (US)",
volume = "2",
pages = "181--184",
journal = "Current Psychology",
issn = "1046-1310",
publisher = "Springer New York",
number = "3",

}

TY - JOUR

T1 - On deciding switching equivalence of graphs

AU - Colbourn, Charles

AU - Corneil, Derek G.

PY - 1980

Y1 - 1980

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85010803374&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85010803374&partnerID=8YFLogxK

U2 - 10.1016/0166-218X(80)90038-4

DO - 10.1016/0166-218X(80)90038-4

M3 - Article

AN - SCOPUS:85010803374

VL - 2

SP - 181

EP - 184

JO - Current Psychology

JF - Current Psychology

SN - 1046-1310

IS - 3

ER -