Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Counting Unlabelled Topologies and Transitive Relations

Simple item page
dc.contributor.authorBrinkmann, Gunnar
dc.contributor.authorMcKay, Brendan
dc.date.accessioned2015-12-13T22:59:09Z
dc.date.available2015-12-13T22:59:09Z
dc.date.issued2005
dc.date.updated2015-12-12T07:26:52Z
dc.description.abstractA 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.
dc.identifier.issn1530-7638
dc.identifier.urihttp://hdl.handle.net/1885/83639
dc.publisherUniversity of Waterloo
dc.sourceJournal of Integer Sequences
dc.subjectKeywords: Computational methods; Graph theory; Number theory; Set theory; Theorem proving; Directed graph; Finite topology; Graph; Transitive relation; Topology Directed graph; Finite topology; Order; Transitive relation
dc.titleCounting Unlabelled Topologies and Transitive Relations
dc.typeJournal article
local.bibliographicCitation.startpage05.2.1
local.contributor.affiliationBrinkmann, Gunnar, Ghent University
local.contributor.affiliationMcKay, Brendan, College of Engineering and Computer Science, ANU
local.contributor.authoruidMcKay, Brendan, u8304521
local.description.notesImported from ARIES
local.description.refereedYes
local.identifier.absfor010399 - Numerical and Computational Mathematics not elsewhere classified
local.identifier.ariespublicationMigratedxPub11922
local.identifier.citationvolume8
local.identifier.scopusID2-s2.0-21244501324
local.type.statusPublished Version

Downloads

Collections

ANU Research Publications

DSpace software copyright © 2002-2026 LYRASIS