Counting unlabelled topologies and transitive relations

Gunnar Brinkmann*, Brendan D. McKay

*Corresponding author for this work

    Research output: Contribution to journalArticlepeer-review

    11 Citations (Scopus)

    Abstract

    A classification of various types of unlabled topologies and transition relations that counts up to 15 or 16 points was discussed. Only directed graphs (digraphs) that do not have multiple edges but may have up to one loop point were considered for the computation. A strong component of a digraph was a maximal set of points such that there was a directed path within P from x to y for each pair x, y ⊂ P. It was found that two digraphs were isomorphic if there was a bijection between their point-set that induces a bijection between their edge-sets.

    Original languageEnglish
    JournalJournal of Integer Sequences
    Volume8
    Issue number2
    Publication statusPublished - 29 Mar 2005

    Fingerprint

    Dive into the research topics of 'Counting unlabelled topologies and transitive relations'. Together they form a unique fingerprint.

    Cite this