Related papers: Weakly distance-regular digraphs of valency three,…
A graph is called a strong (resp. weak) bar 1-visibility graph if its vertices can be represented as horizontal segments (bars) in the plane so that its edges are all (resp. a subset of) the pairs of vertices whose bars have a…
A Riemannian manifold $M$ is called weakly symmetric if any two points in $M$ can be interchanged by an isometry. The compact ones have been well understood, and the main remaining case is that of 2-step nilpotent Lie groups. We give a…
In this paper, we define weakly coherent rings, and examine the transfer of these rings to homomorphic image, trivial ring extension, localization, and direct product. These results provide examples of weakly coherent rings that are not…
We classify isomorphism-invariant random digraphs according to where randomness resides, namely, arcs, vertices, and vertices and arcs together which in turn yield arc random digraphs (ARD), vertex random digraphs (VRD) and vertex-arc…
We determine the distance-regular graphs with diameter at least $3$ and $c_2\geq 2$ but without induced $K_{1,4}$-subgraphs.
For a non-split multi-crossing diagram $D$ of a link $L$ we show that $\alpha(L)-2 \leq c_2(D) + \sum_{n> 2}(2n-4)c_n(D)$ holds. Here $\alpha(L)$ is the arc index and $c_n(D)$ is the number of $n$-crossings of $D$. This generalizes and…
Given a dimension function $\omega$, we define a notion of an $\omega$-vector weighted digraph and an $\omega$-equivalence between them. Then we establish a bijection between the weakly $(\mathbb{Z}/2)^n$-equivariant homeomorphism classes…
A strongly connected digraph is called a cactoid-type if each of its blocks is a digraph consisting of finitely many oriented cycles sharing a common directed path. In this article, we find the formula for the determinant of the distance…
In this paper, we characterize some certain directed strongly regular Cayley graphs on Dihedral groups $D_{n}$, where $n\geqslant 3$ is a positive integer.
We obtain weak type (1,1) estimates for the inverses of truncated discrete rough Hilbert transform. We include an ex- ample showing that our result is sharp. One of the ingredients of the proof are regularity estimates for convolution of…
Given a connected graph $G$, a set of vertices $X\subset V(G)$ is a weak $k$-resolving set of $G$ if for each two vertices $y,z\in V(G)$, the sum of the values $|d_G(y,x)-d_G(z,x)|$ over all $x\in X$ is at least $k$, where $d_G(u,v)$ stands…
A non-complete graph is \emph{$2$-distance-transitive} if, for $i=1,2$ and for any two vertex pairs $(u_1,v_1)$ and $(u_2,v_2)$ with the same distance $i$ in the graph, there exists an element of the graph automorphism group that maps…
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…
In this article, we introduce a category of weak Lie 3-algebras with suitable weak morphisms. The definition is based on the construction of a partial resolution over $\mathbb{Z}$ of the Koszul dual cooperad of the $\textrm{Lie}$ operad,…
Starting from pointwise gradient estimates for the heat semigroup, we study three characterizations of weak lower curvature bounds on metric graphs. More precisely, we prove the equivalence between a weak notion of the Bakry-\'Emery…
We find a lower bound on the proportion of derangements in a finite transitive group that depends on the minimal nontrivial subdegree. As a consequence, we prove that, if $\Gamma$ is a $G$-vertex-transitive digraph of valency $d\ge 1$, then…
A non-complete geometric distance-regular graph is the point graph of a partial geometry in which the set of lines is a set of Delsarte cliques. In this paper, we prove that for fixed integer $m\geq 2$, there are only finitely many…
We prove that stationary Yang$-$Mills fields in dimensions 5 belonging to the variational class of weak connections are smooth away from a closed singular set $S$ of vanishing 1-dimensional Hausdorff measure. Our proof is based on an…
In this paper we obtain $(q+3)$--regular graphs of girth 5 with fewer vertices than previously known ones for $q=13,17,19$ and for any prime $q \ge 23$ performing operations of reductions and amalgams on the Levi graph $B_q$ of an elliptic…
A graph is said to be {\em half-arc-transitive} if its automorphism group acts transitively on the set of its vertices and edges but not on the set of its arcs. With each half-arc-transitive graph of valency 4 a collection of the so called…