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

If a vertex in a graph can be deleted without affecting distances among the other vertices, we shall say it is distance-redundant. Graphs with all, some or no such vertices are discussed. (The latter class was termed distance-critical by…

The problem of finding graph structure of functions commuting with a given function in terms of their functional graphs is considered. Structure of functional graphs of commuting functions is described. The problem is reduced to describing…

A connected, locally finite graph $\Gamma$ is a Cayley--Abels graph for a totally disconnected, locally compact group $G$ if $G$ acts vertex-transitively with compact, open vertex stabilizers on $\Gamma$. Define the minimal degree of $G$ as…

Consider the self-map F of the space of real-valued test functions on the line which takes a test function f to the test function sending a real number x to f(f(x))-f(0). We show that F is discontinuous, although its restriction to the…

Contraction of an edge merges its end points into a new vertex which is adjacent to each neighbor of the end points of the edge. An edge in a $k$-connected graph is {\em contractible} if its contraction does not result in a graph of lower…

We explore the dynamics of graph maps with zero topological entropy. It is shown that a continuous map $f$ on a topological graph $G$ has zero topological entropy if and only if it is locally mean equicontinuous, that is the dynamics on…

The tree of decomposition of a $k$-connected graph by a set $\mathfrak S$ of pairwise independent $k$-vertex cutsets is defined as follows. The vertices of this tree are cutsets of $\mathfrak S$ and parts of decomposition of the graph by…

We present a new, novel approach to obtaining a network's connectivity. More specifically, we show that there exists a relationship between a network's graph isoperimetric properties and its conditional connectivity. A network's…

It is proven that a connected graph is planar if and only if all its cocycles with at least four edges are "grounded" in the graph. The notion of grounding of this planarity criterion, which is purely combinatorial, stems from the intuitive…

Let $G$ be a connected graph. The edge-connectivity of $G$, denoted by $\lambda(G)$, is the minimum number of edges whose removal renders $G$ disconnected. Let $\delta(G)$ be the minimum degree of $G$. It is well-known that $\lambda(G) \leq…

A rooted network consists of a connected, locally finite graph G, equipped with edge conductances and a distinguished vertex o. A nonnegative function on the vertices of G which vanishes at o, has Laplacian 1 at o, and is harmonic at all…

A function $f:X\to Y$ between topological spaces is said to be a {\it weakly Gibson function} if $f(\overline{U})\subseteq \overline{f(U)}$ for any open connected set \mbox{$U\subseteq X$}. We prove that if $X$ is a locally connected…

A metric space (X,d) is monotone if there is a linear order < on X and a constant c>0 such that d(x,y) < c d(x,z) for all x<y<z in X. Properties of continuous functions with monotone graph (considered as a planar set) are investigated. It…

Let $f$ be a piecewise continuous and monotonic map on the interval with at most finitely many discontinuities and turning points. In this paper we study properties about this class of maps and show its main difference from the continuous…

The theory of graphons is ultimately connected with the so-called cut norm. In this paper, we approach the cut norm topology via the weak* topology (when considering a predual of $L^{1}$-functions). We prove that a sequence…

Given a finite undirected graph $X$, a vertex is $0$-dismantlable if its open neighbourhood is a cone and $X$ is $0$-dismantlable if it is reducible to a single vertex by successive deletions of $0$-dismantlable vertices. By an iterative…

Given a 2-generated finite group $G$, the non-generating graph of $G$ has as vertices the elements of $G$ and two vertices are adjacent if and only if they are distinct and do not generate $G$. We consider the graph $\Sigma(G)$ obtained…

We say that a graph $G$ is $(2,m)$-linked if, for any distinct vertices $a_1,\ldots, a_m, b_1,b_2$ in $G$, there exist vertex disjoint connected subgraphs $A,B$ of $G$ such that $\{a_1, \ldots, a_m\}$ is contained in $A$ and $\{b_1,b_2\}$…

Let $G$ be a graph on $n$ nodes. In this note, we prove that if $G$ is $(r+1)$-vertex connected, $1 \leq r \leq n-2$, then there exists a configuration $p$ in general position in $R^r$ such that the bar framework $(G,p)$ is universally…

Let G be a group and let M be a CAT(0) proper metric space (e.g. a simply connected complete Riemannian manifold of non-positive sectional curvature or a locally finite tree). Isometric actions of G on M are (by definition) points in the…