JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE) ›› 2017, Vol. 52 ›› Issue (4): 100-104.doi: 10.6040/j.issn.1671-9352.0.2016.362

Previous Articles     Next Articles

The digraphs representation of finite topologies

MA Hai-cheng1,2, LI Sheng-gang2   

  1. 1. Department of Mathematics, Qinghai University for Nationalities, Xining 810007, Qinghai, China;
    2. College of Mathematics and Information Science, Shaanxi Normal University, Xian 710062, Shaanxi, China
  • Received:2016-07-23 Online:2017-04-20 Published:2017-04-11

PDF (PC)

1064

Abstract: A digraph which is called topology graph is defined for each finite topology space. First, an equivalence relation between elements is defined, and then, the equivalence classes is came into being. These digraphs is defined by using the inclusion relation between equivalence classes. Topological space and its topology graph to determine each other is proved. It is easy to calculate the closure, the derived set, the interior and border of a set by using the topology graph. The connectedness consistent of the topological space and its topology graph is proved. The number of non-homeomorphism topology with 1≤n≤4 elements is calculated by using the topology graph.

Key words: finite topology, closure axioms, digraph

CLC Number: 

  • O157.5
[1] DIESTEL R, KH(¨overU)N D. Topological paths, cycles and spanning trees in infinite graphs[J]. European Journal of Combinatorics, 2004, 25:835-862.
[2] DIESTEL R. The cycle space of an infinite graph[J]. Combin Probab Comput, 2005, 14:59-79.
[3] DIESTEL R. End spaces and spanning trees[J]. Journal of Combinatorial Theory, Series B, 2006, 96:846-854.
[4] AGELOS GEORGAKOPOULOS. Graph topologies induced by edge lengths[J]. Discrete Mathematics, 2011, 311:1523-1542.
[5] DIESTEL R, KH(¨overU)N D. Topological paths, cycles and spanning trees in infinite graphs[J]. European Journal of Combinatorics, 2004, 25:835-862.
[6] RICHTER BRUCE R. Graph-like spaces: an introduction[J]. Discrete Mathematics, 2011, 311:1390-1396.
[7] DIESTEL R. Locally finite graphs with ends: a topological approach. I. basic theory[J]. Discrete Mathematics, 2011, 311:1423-1447.
[8] DIESTEL R. Locally finite graphs with ends: a topological approach, II. applications[J]. Discrete Mathematics, 2010, 310:2750-2765.
[9] DIESTEL R, SPR(¨overU)SSEL P. Locally finite graphs with ends: a topological approach. III. fundamental group and homology[J]. Discrete Mathematics, 2012, 312:21-29.
[10] 熊金城. 点集拓扑讲义[M]. 3rd. 北京:高等教育出版社,2003. XIONG Jincheng. Poing set topology[M]. 3rd. Beijing: Higher Education Press, 2003.
[11] BONDY J A, MURTY U S R. Graph theory with applications[M]. New York: The Macmillan Press, 1976.
[1] LUO Mei-jin,GAO Yu-bin . Primitive exponents of a class of three-colored digraphs with three cycles [J]. J4, 2008, 43(1): 65-72 .
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
Copyright 2018 © Editorial office of JOURNAL OF SHANDONG UNIVERSITY(NATURAL SCIENCE)
Supported by Beijing Magtech Co.Ltd