Related papers: Ultrametric spaces generated by labeled star graph…

A topological space is said to be cardinality homogeneous if every nonempty open subset has the same cardinality as the space itself. Let $X$ and $Y$ be cardinality homogeneous metric spaces of the same cardinality. If there exists a…

We give a criterion for maps on ultrametric spaces to be surjective and to preserve spherical completeness. We show how Hensel's Lemma and the multi-dimensional Hensel's Lemma follow from our result. We give an easy proof that the latter…

The formalism to determine (conformal) isometries of a given curved superspace was elaborated almost two decades ago in the context of the old minimal formulation for N=1 supergravity in four dimensions (4D). This formalism is universal,…

We prove that the isometry group $\Iso(\Ur)$ of the universal Urysohn metric space $\Ur$ equipped with the natural Polish topology is a L\'evy group in the sense of Gromov and Milman, that is, admits an approximating chain of compact (in…

We introduce a new class of countably infinite random geometric graphs, whose vertices are points in a metric space, and vertices are adjacent independently with probability p if the metric distance between the vertices is below a given…

This paper demonstrates that every ultrametric space is homeomorphic to a clade space of a pruned tree, i.e., a subspace of a tree's canopy. Furthermore, it characterizes several topological properties of ultrametrizable spaces through the…

A graph is said to be a Sterboul--Deming graph if $KE(G)=\emptyset$, that is, if every vertex of $G$ belongs to a posy or a flower (structures introduced by Sterboul, Deming, and Edmonds). These graphs can be regarded as the structural…

The Urysohn space is the unique separable metric space that is universal and homogeneous for finite metric spaces, i.e., it embeds any finite metric space any isometry between finite subspaces extends to an isometry of the whole space. We…

A subperiodic group is a group of motions of $d$-dimensional Euclidean space $\R^d$ which contains a translation lattice $\Z^r$ of rank $r < d$ as a subgroup of finite index. A classification into abstract group isomorphism classes is…

We call a \emph{comb} a map $f:I\to [0,\infty)$, where $I$ is a compact interval, such that $\{f\ge \varepsilon\}$ is finite for any $\varepsilon$. A comb induces a (pseudo)-distance $\dtf$ on $\{f=0\}$ defined by $\dtf(s,t) =…

Given a metric space $(X,d)$, a set $S\subseteq X$ is called a $k$-\emph{metric generator} for $X$ if any pair of different points of $X$ is distinguished by at least $k$ elements of $S$. A $k$-\emph{metric basis} is a $k$-metric generator…

We find a set of generators for the automorphism group of a graph product of finitely generated abelian groups entirely from a certain labeled graph. In addition, we find generators for the important subgroup of star-automorphisms defined…

We prove that every point-determining digraph $D$ contains a vertex $v$ such that $D-v$ is also point determining. We apply this result to show that for any $\{0,1\}$-matrix $M$, with $k$ diagonal zeros and $\ell$ diagonal ones, the size of…

A \emph{directional labeling} of an edge $\emph{uv}$ in a graph $G=(V,E)$ by an ordered pair $ab$ is a labeling of the edge $uv$ such that the label on $uv$ in the direction from $u$ to $v$ is $\ell(uv)=ab$, and $\ell(vu)=ba$. New…

The line generated by two distinct points, $x$ and $y$, in a finite metric space $M=(V,d)$, denoted by $\overline{xy}^M$, is the set of points given by $$\overline{xy}^M:=\{z\in V: d(x,y)=|d(x,z)\pm d(z,y)|\}.$$ A 2-set $\{x,y\}$ such that…

Let $\gamma(G)$ denote the domination number of a graph $G$. A vertex $v\in V(G)$ is called a \emph{critical vertex} of $G$ if $\gamma(G-v)=\gamma(G)-1$. A graph is called \emph{vertex-critical} if every vertex of it is critical. In this…

The automorphisms of a graph act naturally on its set of labeled imbeddings to produce its unlabeled imbeddings. The imbedding sum of a graph is a polynomial that contains useful information about a graph's labeled and unlabeled imbeddings.…

For a star-shaped graph, we introduce special characters and study their properties. We decompose special characters into odd and even parts and study their evolution under reflections. We apply the obtained formulas to prove that the…

We consider large uniform labeled random graphs in different classes with prescribed decorations in their modular decomposition. Our main result is the estimation of the number of copies of every graph as an induced subgraph. As a…

We establish universality and ultra-homogeneity of $(\mathcal{U},u_\mathrm{GH})$, the collection of all compact ultrametric spaces endowed with the so-called Gromov-Hausdorff ultrametric. This result also gives rise to a novel construction…