Kyungpook Mathematical Journal

  • 제54권4호
  • /
  • Pages.655-665
  • /
  • 2014
  • /
  • 1225-6951(pISSN)
  • /
  • 0454-8124(eISSN)
경북대학교 자연과학대학 수학과 (Department of Mathematics, Kyungpook National University)
권호 표지
DOI QR코드

DOI QR Code

Enumerations of Finite Topologies Associated with a Finite Simple Graph

  • 투고 : 2014.04.18
  • 심사 : 2014.08.05
  • 발행 : 2014.12.23
PDF 다운로드
⟨ 이전 논문 다음 논문 ⟩

초록

The number of topologies (non-homeomorphic topologies) on a fixed finite set having n elements are now known up to n = 18 (n = 16 respectively) but still no complete formula yet. There are one to one correspondences among topologies, preorders and transitive digraphs on a given finite set. In this article, we enumerate topologies and non-homeomorphic topologies whose underlying graph is a given finite simple graph.

키워드

참고문헌

  1. L. W. Brinn, Computing topologies, Mathematics Magazine, 58(1985), 67-77. https://doi.org/10.2307/2689890
  2. J. W. Evans, F. Harary and M. S. Lynn, On the computer enumeration of finite topologies, Communications of the ACM, 10(1967), 295-297. https://doi.org/10.1145/363282.363311
  3. J. Gross and T. Tucker, Topological graph theory, Wiley-Interscience Series in discrete Mathematics and Optimization, Wiley & Sons, New York, 1987.
  4. V. A. Kovalevsky, Finite topology as applied to image analysis, Computer Vision, Graphics, and Image Processing, 46(1989), 141-161. https://doi.org/10.1016/0734-189X(89)90165-5
  5. V. A. Kovalevsky, Finite topology and image analysis, Advances in electronics and electron physics, 84(1992), 197-324. https://doi.org/10.1016/S0065-2539(08)61037-9
  6. C. Marijuan, Finite topology and digraphs, Proyecciones Journal of Mathematics, 29(2010), 291-307.
  7. R. Merrifield and H. Simmons, The structures of molecular topological spaces, Theoretica Chimica Acta, 55(1980), 55-75. https://doi.org/10.1007/BF00551410
  8. R. Merrifield and H. Simmons, Topological methods in chemistry, Wiley, New York, 1989.
  9. K. Ragnarsson and B. E. Tenner, Obtainable sizes of topologies on finite sets, Journal of Combinatorial Theory, Series A, 117(2010), 138-151, arXiv:0802.2550 https://doi.org/10.1016/j.jcta.2009.05.002
  10. A. Rosenfeld, T. Kong and A. Wu, Digital surfaces, Graphical Models and Image Processing, 53(1991), 305-312. https://doi.org/10.1016/1049-9652(91)90034-H
  11. N. J. A. Sloane, On-Line Encyclopedia of Integer Sequences, A000798, A001035, A001930, A000112. Available at http://oeis.org/.
  12. J. R. Stallings, Topology of finite graphs, Invent. math., 71(1983), 551-565. https://doi.org/10.1007/BF02095993
  13. T. Van Zandt. PSTricks: PostScript macros for generic TEX. Available at ftp://ftp.princeton.edu/pub/tvz/.