Related papers: The closed graph function from plane with the netw…

We consider the curve graph in the cases where it is not a Farey graph, and show that its Gromov boundary is linearly connected. For a fixed center point c and radius r, we define the sphere of radius r to be the induced subgraph on the set…

We prove that the accumulation points of a sequence of graphs $G_1,G_2,G_3,\ldots$ with respect to the cut-distance are exactly the weak$^*$ limit points of subsequences of the adjacency matrices (when all possible orders of the vertices…

For any infinite subset $X$ of the rationals and a subset $F \subseteq X$ which has no isolated points in $X$ we construct a function $f: X \to X$ such that $f(f(x))=x$ for each $x\in X$ and $F $ is the set of discontinuity points of $f$.

In this note we prove that every closed graph $G$ is up to isomorphism a proper interval graph. As a consequence we obtain that there exist linear-time algorithms for closed graph recognition.

Answering a question of Diestel, we develop a topological notion of gammoids in infinite graphs which, unlike traditional infinite gammoids, always define a matroid. As our main tool, we prove for any infinite graph $G$ with vertex sets $A$…

We attempt to generalize a theorem of Nash-Williams stating that a graph has a $k$-arc-connected orientation if and only if it is $2k$-edge-connected. In a strongly connected digraph we call an arc {\it deletable} if its deletion leaves a…

Let $X$ be a compact metric space. By $2^X$ we denote the hyperspace of all closed and non-empty subsets of $X$ endowed with the Hausdorff metric. Let $f:X\to X$ be a continuous function. In this paper we study some topological properties…

Closeness is an important measure of network centrality. In this article we will calculate the closeness of graphs, created by using operations on graphs. We will prove a formula for the closeness of shadow graphs. We will calculate the…

There are different definitions of ends in non-locally-finite graphs which are all equivalent in the locally finite case. We prove the compactness of the end-topology that is based on the principle of removing finite sets of vertices and…

We investigate the connectedness properties of the set $ I^{\!+\!}(f) $ of points where the iterates of an entire function $ f $ are unbounded. In particular, we show that $ I^{\!+\!}(f) $ is connected whenever iterates of the minimum…

We study closed sets $F \subset {\mathbb R}^d$ whose distance function $d_F:= {\rm dist}\,(\cdot,F)$ is DC (i.e., is the difference of two convex functions on ${\mathbb R}^d$). Our main result asserts that if $F \subset {\mathbb R}^2$ is a…

Given a graph $G$ whose edges are perfectly reliable and whose nodes each operate independently with probability $p\in[0,1],$ the node reliability of $G$ is the probability that at least one node is operational and that the operational…

The entropy of a digraph is a fundamental measure which relates network coding, information theory, and fixed points of finite dynamical systems. In this paper, we focus on the entropy of undirected graphs. We prove that for any integer $k$…

We generalise a fundamental graph-theoretical fact, stating that every element of the cycle space of a graph is a sum of edge-disjoint cycles, to arbitrary continua. To achieve this we replace graph cycles by topological circles, and…

We investigate some connectedness properties of the set of points K(f) where the iterates of an entire function f are bounded. In particular, we describe a class of transcendental entire functions for which an analogue of the…

Given a finite group $G,$ we denote by $\Delta(G)$ the graph whose vertices are the elements $G$ and where two vertices $x$ and $y$ are adjacent if there exists a minimal generating set of $G$ containing $x$ and $y.$ We prove that…

Using closure concepts, we show that within every undirected network, or graph, there is a unique irreducible subgraph which we call its "spine". The chordless cycles which comprise this irreducible core effectively characterize the…

We generalize the idea of cofinite groups, due to B. Hartley. First we define cofinite spaces in general. Then, as a special situation, we study cofinite graphs and their uniform completions. The idea of constructing a cofinite graph starts…

This paper proposes a family of network centralities called fixed-point centralities. This centrality family is defined via the fixed point of permutation equivariant mappings related to the underlying network. Such a centrality notion is…

We have defined and established a theory of cofinite connectedness of a cofinite graph. Many of the properties of connectedness of topological spaces have analogs for cofinite connectedness. We have seen that if $G$ is a cofinite group and…