Related papers: Closed graph property in Alexandroff spaces

In the following text for Khalimsky $n-$dimensional space $\mathcal{K}^n$ we show self--map $f:\mathcal{K}^n\to\mathcal{K}^n$ has closed graph if and only if there exist integers $\lambda_1,\ldots,\lambda_n$ such that $f$ is a constant map…

We discuss topological versions of the closed graph theorem, where continuity is inferred from near continuity in tandem with suitable conditions on source or target spaces. We seek internal characterizations of spaces satisfying a closed…

A graph is closed when its vertices have a labeling by [n] with a certain property first discovered in the study of binomial edge ideals. In this article, we prove that a connected graph has a closed labeling if and only if it is chordal,…

A function $f:X\to \mathbb R$ defined on a topological space $X$ is called returning if for any point $x\in X$ there exists a positive real number $M_x$ such that for every path-connected subset $C_x\subset X$ containing the point $x$ and…

The main result of this paper states, that if a function $f:\R^2\to [0, +\infty)$ has a closed graph and the set of discontinuity points is a network (as defined by Kuratowski in Topology II, 61.IV), then the graph of $f$ is disconnected.…

Let $E,F$ be two topological spaces and $u:E\rightarrow F$ be a map. \ If $F$ is Haudorff and $u$ is continuous, then its graph is closed. \ \ The Closed Graph Theorem establishes the converse when $E$ and $F$ are suitable objects of…

The main result of this paper states that for a function $f:\R^2\to Y$ with a closed, connected and locally connected graph, where $Y$ is a locally compact, second-countable metrisable space, the graph over discontinuity points remains…

A space Y is called an extension of a space X if Y contains X as a dense subspace. An extension Y of X is called a one-point extension if Y-X is a singleton. Compact extensions are called compactifications and connected extensions are…

The deck of a topological space $X$ is the set $\mathcal{D}(X)=\{[X \setminus \{x\}] \colon x \in X\}$, where $[Z]$ denotes the homeomorphism class of $Z$. A space $X$ is topologically reconstructible if whenever…

We call a function $f: X\to Y$ $P$-preserving if, for every subspace $A \subset X$ with property $P$, its image $f(A)$ also has property $P$. Of course, all continuous maps are both compactness- and connectedness-preserving and the natural…

A space $X$ is $n$-arc connected (respectively, $n$-circle connected) if for any choice of at most $n$ points there is an arc (respectively, a circle) in $X$ containing the specified points. We study $n$-arc connectedness and $n$-circle…

A map $f:X\to Y$ between topological spaces is defined to be {\em scatteredly continuous} if for each subspace $A\subset X$ the restriction $f|A$ has a point of continuity. We show that for a function $f:X\to Y$ from a perfectly paracompact…

Denote by $\mathcal{A}(\kappa)$ the set of all compact Alexandrov surfaces with curvature bounded below by $\kappa$ without boundary, endowed with the topology induced by the Gromov-Hausdorff metric. We determine the connected components of…

Graph comparison is a certain type of condition on metric space encoded by a finite graph. We show that any nontrivial graph comparison implies one of Alexandrov's comparisons. The proof gives a complete description of graphs with trivial…

An Alexandroff space is a topological space in which every intersection of open sets is open. There is one to one correspondence between Alexandroff $T_0$-spaces and partially ordered sets (posets). We investigate Alexandroff…

We extend the closed graph theorem and the open mapping theorem to a context in which a natural duality interchanges their extensions.

Assume that $\mathcal{P}$ is a topological property of a space $X$, then we say that $X$ is {\it dense-$\mathcal{P}$} if each dense subset of $X$ has the property $\mathcal{P}$. In this paper, we mainly discuss dense subsets of a space $X$,…

The path spaces of a directed graph play an important role in the study of graph $\css$. These are topological spaces that were originally constructed using groupoid and inverse semigroup techniques. In this paper, we develop a simple,…

A graph is closed when its vertices have a labeling by $[n]$ such that the binomial edge ideal $J_G$ has a quadratic Gr\"{o}bner basis with respect to the lexicographic order induced by $x_1 > \cdots > x_n > y_1> \cdots > y_n$. In this…

A graph is closed when its vertices have a labeling by [n] with a certain property first discovered in the study of binomial edge ideals. In this article, we explore various aspects of closed graphs, including the number of closed labelings…