Abstract
AbstractAn algorithm called UNLABEL is devised to uniquely label an unlabelled transitive digraph. This is used to construct a one-one correspondence between homeomorphism classes of finite nondiscrete To-topologies and certain generalised Young tableaux of shape-type α. For sets of cardinality 2, 3, 4 and 5 these classes are enumerated and classified in several ways. The notion of a generalised descriptor graph is then introduced to enumerate the homeomorphism classes of all topologies on these sets.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.