Related papers: Quasi-thin weakly distance-regular digraphs,I

A class of quasilinear singularly perturbed boundary value problems with a turning point of attractive type is considered. The problems are solved numerically by a finite-difference scheme on a special discretization mesh which is dense…

A real matrix $Q$ is quasi-orthogonal if $Q^{\top}Q=qI$, for some positive real number $q$. We prove that any $n\times n$ skew-symmetric matrix $S$ is a principal sub-matrix of a skew-symmetric quasi-orthogonal matrix $Q$, called a…

The roughness of crack interfaces is reported in quasistatic fracture, using an elastic network of beams with random breaking thresholds. For strong disorders we obtain 0.86(3) for the roughness exponent, a result which is very different…

A 2-distance $k$-coloring of a graph $G$ is a proper $k$-coloring such that any two vertices at distance two or less get different colors. The 2-distance chromatic number of $G$ is the minimum $k$ such that $G$ has a 2-distance…

A graph $X$ is said to be unstable if the direct product $X \times K_2$ (also called the canonical double cover of $X$) has automorphisms that do not come from automorphisms of its factors $X$ and $K_2$. It is nontrivially unstable if it is…

Quasi-isometries are mappings on graphs, with distance-distortions parameterized by a multiplicative factor and an additive constant. The distance-distortions of quasi-isometries are in a general form that captures a wide range of…

For a random quasi-abelian code of rate $r$, it is shown that the GV-bound is a threshold point: if $r$ is less than the GV-bound at $\delta$, then the probability of the relative distance of the random code being greater than $\delta$ is…

Weak similarities form a special class of mappings between semimetric spaces. Two semimetric spaces $X$ and $Y$ are weakly similar if there exists a weak similarity $\Phi\colon X\to Y$. We find a structural characteristic of finite…

We consider a bipartite distance-regular graph $G$ with diameter $D$ at least 4 and valency $k$ at least 3. We obtain upper and lower bounds for the local eigenvalues of $G$ in terms of the intersection numbers of $G$ and the eigenvalues of…

Gevrey 2 quasi-periodic cocycles with diophantine frequency, close to a constant, with values in classical Lie groups, are almost reducible in a weak sense. This is the analogue of Eliasson's almost reducibility theorem for analytic…

Let $G$ be a graph with a vertex set $V$. The graph $G$ is path-proximinal if there are a semimetric $d \colon V \times V \to [0, \infty[$ and disjoint proximinal subsets of the semimetric space $(V, d)$ such that $V = A \cup B$, and…

We present a nonperturbative quasi-classical theory of graphene photoconductivity. We consider the influence of low-frequency (microwave, terahertz, mid-infrared) radiation on the static conductivity of a uniform graphene layer and…

We determine the distance-regular graphs with diameter at least $3$ and $c_2\geq 2$ but without induced $K_{1,4}$-subgraphs.

Representation of Euclidean objects in a digital space has been a focus of research for over 30 years. Digital line segments are particularly important as other digital objects depend on their definition (e.g., digital convex objects or…

We give variants of the Krein bound and the absolute bound for graphs with a spectrum similar to that of a strongly regular graph. In particular, we investigate what we call approximately strongly regular graphs. We apply our results to…

The spectral excess theorem for distance-regular graphs states that a regular (connected) graph is distance-regular if and only if its spectral-excess equals its average excess. A bipartite graph is distance-biregular when it is…

Sobolev mappings exhibiting only pointwise quasiregularity-type bounds have arisen in various applications, leading to a recently developed theory of quasiregular values. In this article, we show that by using rescaling, one obtains a…

Let $D=(V,A)$ be a digraph. A vertex set $K\subseteq V$ is a quasi-kernel of $D$ if $K$ is an independent set in $D$ and for every vertex $v\in V\setminus K$, $v$ is at most distance 2 from $K$. In 1974, Chv\'atal and Lov\'asz proved that…

We construct an exact expression for the site percolation threshold p_c on a quasi-regular tree, and a related exact lower bound for a quasi-regular graph. Both are given by the inverse spectral radius of the appropriate Hashimoto matrix…

A singularity is said to be weakly-exceptional if it has a unique purely log terminal blow up. This is a natural generalization of the surface singularities of types $D_{n}$, $E_{6}$, $E_{7}$ and $E_{8}$. Since this idea was introduced,…