Concerning the complexity of deciding isomorphism of block designs

Marlene J. Colbourn, Charles J. Colbourn

Research output: Contribution to journalArticle

11 Scopus citations

Abstract

A construction is described to encode an arbitrary graph uniquely as a block design. This demonstrates that describing whether two block designs (without repeated blocks) are isomorphic is polynomial time equivalent to solving graph isomorphism. This result supplies evidence for the claim that isomorphism testing for block designs is a hard subcase of graph isomorphism.

Original languageEnglish (US)
Pages (from-to)155-162
Number of pages8
JournalDiscrete Applied Mathematics
Volume3
Issue number3
DOIs
StatePublished - Jul 1981
Externally publishedYes

    Fingerprint

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Cite this