A graph $G$ is a $k$-tree if either $G$ is the complete graph on $k+1$ vertices, or $G$ has a vertex $v$ whose neighborhood is a clique of order $k$ and the graph obtained by removing $v$ from $G$ is also a $k$-tree. Clearly, a $k$-tree has at least $k+1$ vertices, and $G$ is a 1-tree (usual tree) if and only if it is a $1$-connected graph and has no $K_3$-minor. In this paper, motivated by some properties of 2-trees, we obtain a characterization of $k$-trees as follows: if $G$ is a graph with at least $k+1$ vertices, then $G$ is...

A proper coloring $c:V\left(G\right)\to \{1,2,...,k\}$, $k\ge 2$ of a graph $G$ is called a graceful $k$-coloring if the induced edge coloring $c^{\text{'}}:E\left(G\right)\to \{1,2,...,k-1\}$ defined by $c^{\text{'}}\left(uv\right)=|c\left(u\right)-c\left(v\right)|$ for each edge $uv$ of $G$ is also proper. The minimum integer $k$ for which $G$ has a graceful $k$-coloring is the graceful chromatic number ${\chi }_g\left(G\right)$. It is known that if $T$ is a tree with maximum degree $\Delta$, then ${\chi }_g\left(T\right)\le \lceil \frac{5}{3}\Delta \rceil$ and this bound is best possible. It is shown for each integer $\Delta \ge 2$ that there is an infinite class of trees $T$ with maximum degree $\Delta$ such that ${\chi }_g\left(T\right)=\lceil \frac{5}{3}\Delta \rceil$. In particular, we investigate for each...

Let G be a graph of order n and size m. A γ-labeling of G is a one-to-one function f:V(G) → 0,1,2,...,m that induces a labeling f’: E(G) → 1,2,...,m of the edges of G defined by f’(e) = |f(u)-f(v)| for each edge e = uv of G. The value of a γ-labeling f is $val\left(f\right)={\Sigma }_{e\in E\left(G\right)}{f}^{\text{'}}K\left(e\right)$. The maximum value of a γ-labeling of G is defined as $va{l}_{max}\left(G\right)=maxval\left(f\right):fisa\gamma -labelingofG$; while the minimum value of a γ-labeling of G is $va{l}_{min}\left(G\right)=minval\left(f\right):fisa\gamma -labelingofG$; The values $va{l}_{max}\left(S_{p,q}\right)$ and $va{l}_{min}\left(S_{p,q}\right)$ are determined for double stars $S_{p,q}$. We present characterizations of connected graphs G of order n for which...

We consider the systems of hyperbolic equations ⎧$uₜₜ=\Delta \left(a(t,x)u\right)+\Delta \left(b(t,x)v\right)+{h(t,x)\left|v\right|}^p$, t > 0, $x\in {ℝ}^N$, (S1) ⎨ ⎩$vₜₜ=\Delta \left(c(t,x)v\right)+{k(t,x)\left|u\right|}^q$, t > 0, $x\in {ℝ}^N$ ⎧$uₜₜ=\Delta \left(a(t,x)u\right)+{h(t,x)\left|v\right|}^p$, t > 0, $x\in {ℝ}^N$, (S2) ⎨ ⎩$vₜₜ=\Delta \left(c(t,x)v\right)+{l(t,x)\left|v\right|}^m+k(t,x){\left|u\right|}^q$, t > 0, $x\in {ℝ}^N$, (S3) ⎧$uₜₜ=\Delta \left(a(t,x)u\right)+\Delta \left(b(t,x)v\right)+{h(t,x)\left|u\right|}^p$, t > 0, $x\in {ℝ}^N$, ⎨ ⎩$vₜₜ=\Delta \left(c(t,x)v\right)+{k(t,x)\left|v\right|}^q$, t > 0, $x\in {ℝ}^N$, in $(0,\infty )\times {ℝ}^N$ with u(0,x) = u₀(x), v(0,x) = v₀(x), uₜ(0,x) = u₁(x), vₜ(0,x) = v₁(x). We show that, in each case, there exists a bound B on N such that for 1 ≤ N ≤ B solutions to the systems blow up in finite time.

We show that any ${\Sigma }_s$-product of at most $𝔠$-many $L\Sigma (\le \omega )$-spaces has the $L\Sigma (\le \omega )$-property. This result generalizes some known results about $L\Sigma (\le \omega )$-spaces. On the other hand, we prove that every ${\Sigma }_s$-product of monotonically monolithic spaces is monotonically monolithic, and in a similar form, we show that every ${\Sigma }_s$-product of Collins-Roscoe spaces has the Collins-Roscoe property. These results generalize some known results about the Collins-Roscoe spaces and answer some questions due to Tkachuk [Lifting the Collins-Roscoe...

The symbol ${\left(X_I\right)}_{\kappa }$ (with κ ≥ ω) denotes the space $X_I:={\prod }_{i\in I}{X}_i$ with the κ-box topology; this has as base all sets of the form $U={\prod }_{i\in I}{U}_i$ with $U_i$ open in $X_i$ and with $|i\in I:U_i\ne X_i|<\kappa$. The symbols w, d and S denote respectively the weight, density character and Suslin number. Generalizing familiar classical results, the authors show inter alia: Theorem 3.1.10(b). If κ ≤ α⁺, |I| = α and each $X_i$ contains the discrete space 0,1 and satisfies $w\left(X_i\right)\le \alpha$, then $w\left(X_{\kappa }\right)={\alpha }^{<\kappa }$. Theorem 4.3.2. If $\omega \le \kappa \le \left|I\right|\le 2^{\alpha }$ and $X={\left(D\left(\alpha \right)\right)}^I$ with D(α) discrete, |D(α)| = α, then $d\left({\left(X_I\right)}_{\kappa }\right)={\alpha }^{<\kappa }$. Corollaries 5.2.32(a)...

A vector $x$ is said to be an eigenvector of a square max-min matrix $A$ if $A\otimes x=x$. An eigenvector $x$ of $A$ is called the greatest $𝐗$-eigenvector of $A$ if $x\in 𝐗=\{x;\underline{x}\le x\le \overline{x}\}$ and $y\le x$ for each eigenvector $y\in 𝐗$. A max-min matrix $A$ is called strongly $𝐗$-robust if the orbit $x,A\otimes x,A^2\otimes x,\cdots$ reaches the greatest $𝐗$-eigenvector with any starting vector of $𝐗$. We suggest an $O\left(n^3\right)$ algorithm for computing the greatest $𝐗$-eigenvector of $A$ and study the strong $𝐗$-robustness. The necessary and sufficient conditions for strong $𝐗$-robustness are introduced...

Let ${ℱ}_h^i(k,n)$ be the $i$-th ordered configuration space of all distinct points $H_1,...,H_h$ in the Grassmannian $Gr(k,n)$ of $k$-dimensional subspaces of ${ℂ}^n$, whose sum is a subspace of dimension $i$. We prove that ${ℱ}_h^i(k,n)$ is (when non empty) a complex submanifold of $Gr{(k,n)}^h$ of dimension $i(n-i)+hk(i-k)$ and its fundamental group is trivial if $i=min(n,hk)$, $hk\ne n$ and $n\&gt;2$ and equal to the braid group of the sphere $ℂ$ $P^1$ if $n=2$. Eventually we compute the fundamental group in the special case of hyperplane arrangements, i.e. $k=n-1$.

We consider $C^2$ families $t\mapsto f_t$ of $C^4$ unimodal maps $f_t$ whose critical point is slowly recurrent, and we show that the unique absolutely continuous invariant measure ${\mu }_t$ of $f_t$ depends differentiably on $t$, as a distribution of order $1$. The proof uses transfer operators on towers whose level boundaries are mollified via smooth cutoff functions, in order to avoid artificial discontinuities. We give a new representation of ${\mu }_t$ for a Benedicks-Carleson map $f_t$, in terms of a single smooth function and the...

Let $T_1,\cdots ,T_d$ be homogeneous trees with degrees $q_1+1,\cdots ,q_d+1\ge 3$, respectively. For each tree, let $𝔥:T_j\to \mathbb{Z}$ be the Busemann function with respect to a fixed boundary point (end). Its level sets are the horocycles. The horocyclic product of $T_1,\cdots ,T_d$ is the graph $\mathrm{𝖣𝖫}(q_1,\cdots ,q_d)$ consisting of all $d$-tuples $x_1\cdots x_d\in T_1\times \cdots \times T_d$ with $𝔥\left(x_1\right)+\cdots +𝔥\left(x_d\right)=0$, equipped with a natural neighbourhood relation. In the present paper, we explore the geometric, algebraic, analytic and probabilistic properties of these graphs and their isometry groups. If $d=2$ and $q_1=q_2=q$ then we obtain a Cayley graph...

For any two positive integers $n$ and $k\ge 2$, let $G(n,k)$ be a digraph whose set of vertices is $\{0,1,...,n-1\}$ and such that there is a directed edge from a vertex $a$ to a vertex $b$ if $a^k\equiv b(modn)$. Let $n={\prod }_{i=1}^r{p}_i^{e_i}$ be the prime factorization of $n$. Let $P$ be the set of all primes dividing $n$ and let $P_1,P_2\subseteq P$ be such that $P_1\cup P_2=P$ and $P_1\cap P_2=\varnothing$. A fundamental constituent of $G(n,k)$, denoted by $G_{P_2}^{*}(n,k)$, is a subdigraph of $G(n,k)$ induced on the set of vertices which are multiples of ${\prod }_{p_i\in P_2}{p}_i$ and are relatively prime to all primes $q\in P_1$. L. Somer and M. Křížek proved that the trees attached...

We consider “nonconventional” averaging setup in the form $\frac{\mathrm{d}{X}^{\epsilon }\left(t\right)}{\mathrm{d}t}=\epsilon B(X^{\epsilon }\left(t\right)$, $𝛯\left(q_1\left(t\right)\right),𝛯\left(q_2\left(t\right)\right),...,𝛯\left(q_{\ell }\left(t\right)\right))$ where $𝛯\left(t\right)$, $t\ge 0$ is either a stochastic process or a dynamical system with sufficiently fast mixing while $q_j\left(t\right)={\alpha }_{j}t$, ${\alpha }_{1}lt;{\alpha }_{2}lt;\cdots lt;{\alpha }_k$ and $q_j$, $j=k+1,...,\ell$ grow faster than linearly. We show that the properly normalized error term in the “nonconventional” averaging principle is asymptotically Gaussian.

The seminal theorem of Cobham has given rise during the last 40 years to a lot of work about non-standard numeration systems and has been extended to many contexts. In this paper, as a result of fifteen years of improvements, we obtain a complete and general version for the so-called substitutive sequences. Let $\alpha$ and $\beta$ be two multiplicatively independent Perron numbers. Then a sequence $x\in A^{\mathbb{N}}$, where $A$ is a finite alphabet, is both $\alpha$-substitutive and $\beta$-substitutive if and only if $x$ is ultimately...