Related papers: Thick weakly distance-regular digraphs
A Shilla distance-regular graph G (say with valency k) is a distance-regular graph with diameter 3 such that its second largest eigenvalue equals to a3. We will show that a3 divides k for a Shilla distance-regular graph G, and for G we…
Let $G$ be a generalized dicyclic group with identity $1$. An inverse closed subset $S$ of $G\setminus\{1\}$ is called minimal if $\langle S\rangle=G$ and there exists some $s\in S$ such that $\langle S\setminus\{s,s^{-1}\} \rangle\neq G$.…
We classify the connected-homogeneous digraphs with more than one end. We further show that if their underlying undirected graph is not connected-homogeneous, they are highly-arc-transitive.
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…
The characterization of bipartite distance-regularized graphs, where some vertices have eccentricity less than four, in terms of the incidence structures of which they are incidence graphs, is known. In this paper we prove that there is a…
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…
Weakly stable torsion classes were introduced by the author and Yekutieli to provide a torsion theoretic characterisation of the notion of weak proregularity from commutative algebra. In this paper we investigate weakly stable torsion…
It is known that a distance-regular graph with valency $k$ at least three admits at most two Q-polynomial structures. % In this note we show that all distance-regular graphs with diameter four and valency at least three admitting two…
A finite collection of unit vectors $S \subset \mathbb{R}^n$ is called a spherical two-distance set if there are two numbers $a$ and $b$ such that the inner products of distinct vectors from $S$ are either $a$ or $b$. We prove that if $a\ne…
We initiate in this article the study of weakly exact structures, a generalization of Quillen exact structures. We introduce weak counterparts of one-sided exact structures and show that a left and a right weakly exact structure generate a…
This paper studies induced paths in strongly regular graphs. We give an elementary proof that a strongly regular graph contains a path $P_4$ as an induced subgraph if and only if it is primitive, i.e. it is neither a complete multipartite…
A weak homomorphism from a graph G to a graph H is a mapping f from V(G) to V(H), where either f(x) = f(y) or {f(x), f(y)} is an element of E(H), and this holds for all {x, y} in E(G). A rectangular grid graph is formed by taking the…
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…
A digraph is connected-homogeneous if every isomorphism between two finite connected induced subdigraphs extends to an automorphism of the whole digraph. In this paper, we completely classify the countable connected-homogeneous digraphs.
We show that the image of repeated differentiation on weak cusp forms is precisely the subspace which is orthogonal to the space of weakly holomorphic modular forms. This gives a new interpretation of the weakly holomorphic Hecke…
A \emph{locally irregular graph} is a graph whose adjacent vertices have distinct degrees. We say that a graph $G$ can be decomposed into $k$ locally irregular subgraphs if its edge set may be partitioned into $k$ subsets each of which…
In this paper we study relations between connected and weakly convex domination numbers. We show that in general the difference between these numbers can be arbitrarily large and we focus on the graphs for which a weakly convex domination…
Let $G$ denote a finite abelian group with identity 1 and let $S$ denote an inverse-closed subset of $G \setminus {1}$, which generates $G$ and for which there exists $s \in S$, such that $\la S \setminus \{s,s^{-1}\} \ra \ne G$. In this…
In `A survey of two-graphs' \cite{Sei}, J.J. Seidel lays out the connections between simple graphs, two-graphs, equiangular lines and strongly regular graph. It is well known that there is a one-to-one correspondence between regular…
A connected graph $\G$ is called {\em nicely distance--balanced}, whenever there exists a positive integer $\gamma=\gamma(\G)$, such that for any two adjacent vertices $u,v$ of $\G$ there are exactly $\gamma$ vertices of $\G$ which are…