scholarly journals On a Topological Space Generated by Monophonic Eccentric Neighborhoods of a Graph

2021 ◽  
Vol 14 (3) ◽  
pp. 695-705
Author(s):  
Anabel Enriquez Gamorez ◽  
Sergio R. Canoy Jr.
Keyword(s):  
Topological Space ◽  
Discrete Topology ◽  
Vertex Set ◽  
Indiscrete Topology

In this paper, we present a way of constructing a topology on a vertex set of a graph using monophonic eccentric neighborhoods of the graph G. In this type of construction, we characterize those graphs that induced the indiscrete topology, the discrete topology, and a particular point topology.

scholarly journals Mapping i2 on the free paratopological groups

2017 ◽  
Vol 101 (115) ◽  
pp. 213-221
Author(s):  
Fucai Lin ◽  
Chuan Liu
Keyword(s):  
Topological Space ◽  
Nonnegative Integer ◽  
Discrete Topology ◽  
Natural Mapping ◽  
Closed Mapping ◽  
Paratopological Group

Let FP(X) be the free paratopological group over a topological space X. For each nonnegative integer n ? N, denote by FPn(X) the subset of FP(X) consisting of all words of reduced length at most n, and in by the natural mapping from (X ? X?1 ? {e})n to FPn(X). We prove that the natural mapping i2:(X ? X?1 d ?{e})2 ? FP2(X) is a closed mapping if and only if every neighborhood U of the diagonal ?1 in Xd x X is a member of the finest quasi-uniformity on X, where X is a T1-space and Xd denotes X when equipped with the discrete topology in place of its given topology.

On Quasi Discrete Topological Spaces in Information Systems

2012 ◽  
Vol 3 (2) ◽  
pp. 38-52 ◽  
Author(s):  
Tutut Herawan
Keyword(s):  
Information System ◽  
Information Systems ◽  
Topological Space ◽  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Topological Spaces ◽  
Discrete Topology

This paper presents an alternative way for constructing a topological space in an information system. Rough set theory for reasoning about data in information systems is used to construct the topology. Using the concept of an indiscernibility relation in rough set theory, it is shown that the topology constructed is a quasi-discrete topology. Furthermore, the dependency of attributes is applied for defining finer topology and further characterizing the roughness property of a set. Meanwhile, the notions of base and sub-base of the topology are applied to find attributes reduction and degree of rough membership, respectively.

scholarly journals Topologies on Z n that Are Not Homeomorphic to the n-Dimensional Khalimsky Topological Space

Mathematics ◽  
2019 ◽  
Vol 7 (11) ◽  
pp. 1072 ◽  
Author(s):  
Sang-Eon Han ◽  
Saeid Jafari ◽  
Jeong Kang
Keyword(s):  
Applied Sciences ◽  
Topological Space ◽  
Set Theory ◽  
Rough Set ◽  
Rough Set Theory ◽  
Fixed Point Theory ◽  
Point Theory ◽  
Discrete Topology ◽  
Separation Axiom ◽  
Different Types

The present paper deals with two types of topologies on the set of integers, Z : a quasi-discrete topology and a topology satisfying the T 1 2 -separation axiom. Furthermore, for each n ∈ N , we develop countably many topologies on Z n which are not homeomorphic to the typical n-dimensional Khalimsky topological space. Based on these different types of new topological structures on Z n , many new mathematical approaches can be done in the fields of pure and applied sciences, such as fixed point theory, rough set theory, and so on.

The Position of Rough Set in Soft Set

2012 ◽  
Vol 3 (3) ◽  
pp. 33-48
Author(s):  
Tutut Herawan
Keyword(s):  
Topological Space ◽  
Set Theory ◽  
Rough Set ◽  
Equivalence Relation ◽  
Rough Set Theory ◽  
Soft Set ◽  
General Topology ◽  
Discrete Topology ◽  
Special Case

In this paper, the author presents the concept of topological space that must be used to show a relation between rough set and soft set. There are two main results presented; firstly, a construction of a quasi-discrete topology using indiscernibility (equivalence) relation in rough set theory is described. Secondly, the paper describes that a “general” topology is a special case of soft set. Hence, it is concluded that every rough set can be considered as a soft set.

Almost empty polygons

2003 ◽  
Vol 40 (3) ◽  
pp. 269-286 ◽  
Author(s):  
H. Nyklová
Keyword(s):  
Exact Results ◽  
Point Sets ◽  
Planar Point ◽  
Convex Position ◽  
Vertex Set ◽  
Point Set ◽  
Empty Polygons

In this paper we study a problem related to the classical Erdos--Szekeres Theorem on finding points in convex position in planar point sets. We study for which n and k there exists a number h(n,k) such that in every planar point set X of size h(n,k) or larger, no three points on a line, we can find n points forming a vertex set of a convex n-gon with at most k points of X in its interior. Recall that h(n,0) does not exist for n = 7 by a result of Horton. In this paper we prove the following results. First, using Horton's construction with no empty 7-gon we obtain that h(n,k) does not exist for k = 2(n+6)/4-n-3. Then we give some exact results for convex hexagons: every point set containing a convex hexagon contains a convex hexagon with at most seven points inside it, and any such set of at least 19 points contains a convex hexagon with at most five points inside it.

Parallel Residues

2017 ◽  
Author(s):  
Bernhard M¨uhlherr ◽  
Holger P. Petersson ◽  
Richard M. Weiss
Keyword(s):  
Distance Function ◽  
Length Function ◽  
Coxeter System ◽  
Vertex Set ◽  
Ordered Pairs

This chapter considers the notion of parallel residues in a building. It begins with the assumption that Δ‎ is a building of type Π‎, which is arbitrary except in a few places where it is explicitly assumed to be spherical. Δ‎ is not assumed to be thick. The chapter then elaborates on a hypothesis which states that S is the vertex set of Π‎, (W, S) is the corresponding Coxeter system, d is the W-distance function on the set of ordered pairs of chambers of Δ‎, and ℓ is the length function on (W, S). It also presents a notation in which the type of a residue R is denoted by Typ(R) and concludes with the condition that residues R and T of a building will be called parallel if R = projR(T) and T = projT(R).

Valued Field Graph and Some Related Parameters

2020 ◽  
pp. 389-395
Author(s):  
G. Suresh Singh ◽  
P. K. Prasobha
Keyword(s):  
Finite Field ◽  
Independence Number ◽  
Valued Field ◽  
Vertex Set ◽  
Adic Valuation

Let $K$ be any finite field. For any prime $p$, the $p$-adic valuation map is given by $\psi_{p}:K/\{0\} \to \R^+\bigcup\{0\}$ is given by $\psi_{p}(r) = n$ where $r = p^n \frac{a}{b}$, where $p,a,b$ are relatively prime. The field $K$ together with a valuation is called valued field. Also, any field $K$ has the trivial valuation determined by $\psi{(K)} = \{0,1\}$. Through out the paper K represents $\Z_q$. In this paper, we construct the graph corresponding to the valuation map called the valued field graph, denoted by $VFG_{p}(\Z_{q})$ whose vertex set is $\{v_0,v_1,v_2,\ldots, v_{q-1}\}$ where two vertices $v_i$ and $v_j$ are adjacent if $\psi_{p}(i) = j$ or $\psi_{p}(j) = i$. Here, we tried to characterize the valued field graph in $\Z_q$. Also we analyse various graph theoretical parameters such as diameter, independence number etc.

The Spatial Dimensions of Social Networks

2020 ◽  
pp. 367-383
Author(s):  
Zachary P. Neal
Keyword(s):  
Social Networks ◽  
Topological Space ◽  
Network Science ◽  
Spatial Dimensions

The first law of geography holds that everything is related to everything else, but near things are more related than distant things, where distance refers to topographical space. If a first law of network science exists, it would similarly hold that everything is related to everything else, but near things are more related than distant things, but where distance refers to topological space. Frequently these two laws collide, together holding that everything is related to everything else, but topographically and topologically near things are more related than topographically and topologically distant things. The focus of the spatial study of social networks lies in exploring a series of questions embedded in this combined law of geography and networks. This chapter explores the questions that have been asked and the answers that have been offered at the intersection of geography and networks.

Sign in / Sign up

Export Citation Format

Share Document