Related papers: Dimension of graphoids of rational vector-function…

Let CMSO denote the counting monadic second order logic of graphs. We give a constructive proof that for some computable function $f$, there is an algorithm $\mathfrak{A}$ that takes as input a CMSO sentence $\varphi$, a positive integer…

Various different random graph models have been proposed in which the vertices of the graph are seen as members of a metric space, and edges between vertices are determined as a function of the distance between the corresponding metric…

Let $G$ be a graph and $\mathcal{F}$ a family of graphs. Define $\alpha_{\mathcal{F}}(G)$ as the maximum order of any induced subgraph of $G$ that belongs to the family $\mathcal{F}$. For the family $\mathcal{F}$ of graphs with…

The Reeb space of a smooth function is a topological and combinatoric object and fundamental and important in understanding topological and geometric properties of the manifold of the domain. It is the graph and a topological space endowed…

Let $G$ be a graph and $U\subset V(G)$ be a set of vertices. For each $v\in U$, let $h_v\colon U\to \{0, 1\}$ be the function defined by \[h_v(u)=\begin{cases} &1 ~\mbox{if}~u\sim v, u\in U\\&0 ~\mbox{if}~u\not\sim v, u\in U\end{cases},\]…

A set of vertices S is a resolving set of a graph G; if for every pair of vertices x and y in G, there exists a vertex s in S such that x and y differ in distance to s. A smallest resolving set of G is called a metric basis. The metric…

In a recent paper, Caron and Fox suggest a probabilistic model for sparse graphs which are exchangeable when associating each vertex with a time parameter in $\mathbb{R}_+$. Here we show that by generalizing the classical definition of…

We say that a plane set $A$ is {\it graph-null,} if there is a function $g\colon [0,1] \to \mathbb{R}$ such that $\lambda_2 (A+{\rm graph}\, g)=0$. A plane set $A$ has the {\it translational Kakeya property} if, for every translated copy…

For a graph $G=(V,E)$, a function $f:V\rightarrow \{0,1,2\}$ is called Roman dominating function (RDF) if for any vertex $v$ with $f(v)=0$, there is at least one vertex $w$ in its neighborhood with $f(w)=2$. The weight of an RDF $f$ of $G$…

Three dimensional continuous and discrete Fourier-like transforms, based on the three simple and four semisimple compact Lie groups of rank 3, are presented. For each simple Lie group, there are three families of special functions ($C$-,…

Let $v(F)$ denote the number of vertices in a fixed connected pattern graph $F$. We show an infinite family of patterns $F$ such that the existence of a subgraph isomorphic to $F$ is expressible by a first-order sentence of quantifier depth…

Let A_0, A_1 be nonnegative matrices in GL(n+1,Z) such that the subsimplexes A_0[Delta], A_1[Delta] split the standard unit n-dimensional simplex Delta in two. We prove that, for every n=1,2,... and up to the natural action of the symmetric…

We prove that for an arbitrary upper semi-continuous function $\phi\colon G(1,2) \to [0,1]$ there exists a compact set $F$ in the plane such that $\dim_{\textrm{A}} \pi F = \phi(\pi)$ for all $\pi \in G(1,2)$, where $\pi F$ is the…

A space X is finite dimensional, locally compact and separable metrizable if and only if X has a finite basic family: continuous functions Phi_1,...,Phi_n of X to the reals, R, such that for all continuous f from X to R there are g_1,...,…

Given a finite vector space $V=\mathbb{F}_q^n$, the $q$-analogue of a graph, called a $q$-graph, is a pair $\Gamma=(\mathcal{V},\mathcal{E})$, where $\mathcal{V}$ is the set of $1$-dimensional subspaces of $V$ and $\mathcal{E}$ is a subset…

Let $G_1$ and $G_2$ be disjoint copies of a graph $G$, and let $f: V(G_1) \rightarrow V(G_2)$ be a function. Then a \emph{functigraph} $C(G, f)=(V, E)$ has the vertex set $V=V(G_1) \cup V(G_2)$ and the edge set $E=E(G_1) \cup E(G_2) \cup…

Let ${\cal G}$ be a family of graphs defined on a common (labeled) vertex set $V$. A set $S\subset V$ is said to be a simultaneous strong metric generator for ${\cal G}$ if it is a strong metric generator for every graph of the family. The…

An infinite family of graphs ${\cal F}$ is called feasible if for any pair of integers $(n,m)$, $n \geq 1$, $0 \leq m \leq \binom{n}{2}$, there is a member $G \in {\cal F}$ such that $G$ has $n$ vertices and $m$ edges. We prove that given a…

This paper is devoted to the specific class of pseudoconformal mappings of quaternion and octonion variables. Normal families of functions are defined and investigated. Four criteria of a family being normal are proven. Then groups of…

For a family $\mathcal{F}$ of graphs, a graph $G$ is called \emph{$\mathcal{F}$-universal} if $G$ contains every graph in $\mathcal{F}$ as a subgraph. Let $\mathcal{F}_n(d)$ be the family of all graphs on $n$ vertices with maximum degree at…