相关论文: Sets of Complex Unit Vectors with Two Angles and D…

The $k$-independence number of a graph is the maximum size of a set of vertices at pairwise distance greater than $k$. A graph is called $k$-partially walk-regular if the number of closed walks of a given length $l\le k$, rooted at a vertex…

For a given real number $\alpha$, let us place the fractional parts of the points $0, \alpha, 2 \alpha,$ $ \cdots, (N-1) \alpha$ on the unit circle. These points partition the unit circle into intervals having at most three lengths, one…

We use an entropy based method to study two graph maximization problems. We upper bound the number of matchings of fixed size $\ell$ in a $d$-regular graph on $N$ vertices. For $\frac{2\ell}{N}$ bounded away from 0 and 1, the logarithm of…

Any gentle algebra $A$ with one maximal path corresponds to a unique quasi-diagram $\alpha$. We introduce the regularity for $\alpha$, and show that $A$ has finite global dimension if and only if $\alpha$ is regular. We characterize regular…

Let $\Gamma$ denote a distance-regular graph with classical parameters $(D, b, \alpha, \beta)$ and $D\geq 3$. Assume the intersection numbers $a_1=0$ and $a_2\not=0$. We show $\Gamma$ is 3-bounded in the sense of the article [D-bounded…

We consider the problem of determining the number of distinct distances between two point sets in $\mathbb{R}^2$ where one point set $\mathcal{P}_1$ of size $m$ lies on a real algebraic curve of fixed degree $r$, and the other point set…

We revisit the classical question of the relationship between the diameter of a graph and its expansion properties. One direction is well understood: expander graphs exhibit essentially the lowest possible diameter. We focus on the reverse…

We show that large subsets of vector spaces over finite fields determine certain point configurations with prescribed distance structure. More specifically, we consider the complete graph with vertices as the points of $A \subseteq…

In this paper, we focus on a generalised version of Gabriel graphs known as Locally Gabriel graphs ($LGGs$) and Unit distance graphs ($UDGs$) on convexly independent point sets. $UDGs$ are sub graphs of $LGGs$. We give a simpler proof for…

The characterization of distance-regular Cayley graphs originated from the problem of identifying strongly regular Cayley graphs, or equivalently, regular partial difference sets. In this paper, a classification of distance-regular Cayley…

An association scheme is $P$-polynomial if and only if it consists of the distance matrices of a distance-regular graph. Recently, bivariate $P$-polynomial association schemes of type $(\alpha,\beta)$ were introduced by Bernard et al., and…

The dodecacode is a nonlinear additive quaternary code of length $12$. By puncturing it at any of the twelve coordinates, we obtain a uniformly packed code of distance $5$. In particular, this latter code is completely regular but not…

A few properties of unitary Cayley graphs are explored using their eigenvalues. It is shown that the adjacency algebra of a unitary Cayley graph is a coherent algebra. Finally, a class of unitary Cayley graphs that are distance regular are…

We construct distance-regular graphs, including strongly regular graphs, admitting a transitive action of the Chevalley groups $G_2(4)$ and $G_2(5)$, the orthogonal group $O(7,3)$ and the Tits group $T=$$^2F_4(2)'$. Most of the constructed…

Let $\ell$ denote a positive integer. A connected graph $\G$ of diameter at least $\ell$ is said to be $\ell${\it -distance-balanced} whenever for any pair of vertices $u,v$ of $\G$ such that $d(u,v)=\ell$, the number of vertices closer to…

For a group $G$ and a subset $X$ of $G$, the commuting graph of $X$, denoted by $\Gamma(G,X)$ is the graph whose vertex set is $X$ and any two vertices $u$ and $v$ in $X$ are adjacent if and only if they commute in $G$. In this article,…

A recent line of work on VC set systems in minor-free (undirected) graphs, starting from Li and Parter, who constructed a new VC set system for planar graphs, has given surprising algorithmic results. In this work, we initialize a more…

We present a pair of heuristic algorithms. The first is to generate a random regular graph of fixed size. The second is the introduction of the Metropolis Coupled Simulated Annealer (MCSA) for optimizing spectral gaps in fixed size regular…

We introduce a broad class of equations that are described by a graph, which includes many well-studied systems. For these, we show that the number of solutions (or the dimension of the solution set) can be bounded by studying certain…

In this work, the classical Nelson -- Hadwiger problem is studied which lies on the edge of combinatorial geometry and graph theory. It concerns colorings of distance graphs in $ {\mathbb R}^n $, i.e., graphs such that their vertices are…