Skip to main content

Set-reconstruction of chain sizes in a class of finite topologies

Contributed Papers

Part of the Lecture Notes in Mathematics book series (LNM,volume 885)

Abstract

A finite To topology, or an acyclic transitive digraph, partitions its underlying point set uniquely into certain ordered subsets called chains, and the size of a chain is the number of points in it. This paper shows that if a To topology, or an acyclic transgraph, satisfies a prescribed condition then, for any. i, the number of chains with size i is set-reconstructible.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.95
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.A. Bondy and R.L. Hemminger, Graph Reconstruction—A survey, J. Graph Theory, 1 (1977).

    Google Scholar 

  2. S.K. Das, A Partition of Finite To Topologies, Canad. J. Math., 25(1973), 1137–1147.

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. S.K. Das, On the structure of Finite To+T5 Spaees, Canad. J. Math., 25(1973), 1148–1158.

    CrossRef  MathSciNet  Google Scholar 

  4. S.K. Das, A Machine Representation of Finite To Topologies. Journal of the ACM., 24(1977), 676–692.

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. S.K. Das, Some studies in the Theory of Finite Topologies, Doctoral thesis submitted to the University of Calcutta, 1979.

    Google Scholar 

  6. B.D. McKay, Computer Reconstruction of Small Graphs, J. Graph Theory, 1(1977), 281–283.

    CrossRef  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1981 Springer-Verlag

About this paper

Cite this paper

Das Kumar, S. (1981). Set-reconstruction of chain sizes in a class of finite topologies. In: Rao, S.B. (eds) Combinatorics and Graph Theory. Lecture Notes in Mathematics, vol 885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0092266

Download citation

  • DOI: https://doi.org/10.1007/BFb0092266

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11151-1

  • Online ISBN: 978-3-540-47037-3

  • eBook Packages: Springer Book Archive