Searcharxiv⌕ Search

arXiv subjects

Jack H. Koolen

Publications and source records attributed to Jack H. Koolen.

At least 37 records · Page 2Linked to original sources
arXiv2023

Distance-regular graphs with exactly one positive $q$-distance eigenvalue

In this paper, we study the $q$-distance matrix for a distance-regular graph and show that the $q$-distance matrix of a distance-regular graph with classical parameters ($D, q, α, β$) has exactly three distinct eigenvalues, of which one is zero. Moreover, we study distance-regular graphs whose $q$-distance matrix has exactly one positive eigenvalue.

math.CO↗
arXiv2023

A New Feasibility Condition for the AT4 Family

Let $Γ$ be an antipodal distance-regular graph with diameter $4$ and eigenvalues $θ_0>θ_1>θ_2>θ_3>θ_4$. Then $Γ$ is tight in the sense of Jurišić, Koolen, and Terwilliger [12] whenever $Γ$ is locally strongly regular with nontrivial eigenvalues $p:=θ_2$ and $-q:=θ_3$. Assume that $Γ$ is tight. Then the intersection numbers of $Γ$ are expressed in terms of $p$, $q$, and $r$, where $r$ is the size of the antipodal classes of $Γ$. We denote $Γ$ by $\mathrm{AT4}(p,q,r)$ and call this an antipodal tight graph of diameter $4$ with parameters $p,q,r$. In this paper, we give a new feasibility condition for the $\mathrm{AT4}(p,q,r)$ family. We determine a necessary and sufficient condition for the second subconstituent of $\mathrm{AT4}(p,q,2)$ to be an antipodal tight graph. Using this condition, we prove that there does not exist $\mathrm{AT4}(q^3-2q,q,2)$ for $q\equiv3$ $(\mathrm{mod}~4)$. We discuss the $\mathrm{AT4}(p,q,r)$ graphs with $r=(p+q^3)(p+q)^{-1}$.

math.CO↗
arXiv2022

Extending a conjecture of Graham and Lovász on the distance characteristic polynomial

Graham and Lovász conjectured in 1978 that the sequence of normalized coefficients of the distance characteristic polynomial of a tree of order $n$ is unimodal with the maximum value occurring at $\lfloor\frac{n}{2}\rfloor$. In this paper we investigate this problem for block graphs. In particular, we prove the unimodality part and we establish the peak for several extremal cases of uniform block graphs with small diameter.

math.CO↗
arXiv2022

Remarks on pseudo-vertex-transitive graphs with small diameter

Let $Γ$ denote a $Q$-polynomial distance-regular graph with vertex set $X$ and diameter $D$. Let $A$ denote the adjacency matrix of $Γ$. For a vertex $x\in X$ and for $0 \leq i \leq D$, let $E^*_i(x)$ denote the projection matrix to the $i$th subconstituent space of $Γ$ with respect to $x$. The Terwilliger algebra $T(x)$ of $Γ$ with respect to $x$ is the semisimple subalgebra of $\mathrm{Mat}_X(\mathbb{C})$ generated by $A, E^*_0(x), E^*_1(x), \ldots, E^*_D(x)$. Let $V$ denote a $\mathbb{C}$-vector space consisting of complex column vectors with rows indexed by $X$. We say $Γ$ is pseudo-vertex-transitive whenever for any vertices $x,y \in X$, there exists a $\mathbb{C}$-vector space isomorphism $ρ:V\to V$ such that $(ρA - A ρ)V=0$ and $(ρE^*_i(x) - E^*_i(y)ρ)V=0$ for all $0\leq i \leq D$. In this paper, we discuss pseudo-vertex transitivity for distance-regular graphs with diameter $D\in \{2,3,4\}$. For $D=2$, we show that a strongly regular graph is pseudo-vertex-transitive if and only if all its local graphs have the same spectrum. For $D = 3$, we consider the Taylor graphs and show that they are pseudo-vertex transitive. For $D=4$, we consider the antipodal tight graphs and show that they are pseudo-vertex transitive.

math.CO↗
arXiv2022

On the spectrum and linear programming bound for hypergraphs

The spectrum of a graph is closely related to many graph parameters. In particular, the spectral gap of a regular graph which is the difference between its valency and second eigenvalue, is widely seen an algebraic measure of connectivity and plays a key role in the theory of expander graphs. In this paper, we extend previous work done for graphs and bipartite graphs and present a linear programming method for obtaining an upper bound on the order of a regular uniform hypergraph with prescribed distinct eigenvalues. Furthermore, we obtain a general upper bound on the order of a regular uniform hypergraph whose second eigenvalue is bounded by a given value. Our results improve and extend previous work done by Feng-Li (1996) on Alon-Boppana theorems for regular hypergraphs and by Dinitz-Schapira-Shahaf (2020) on the Moore or degree-diameter problem. We also determine the largest order of an $r$-regular $u$-uniform hypergraph with second eigenvalue at most $θ$ for several parameters $(r,u,θ)$. In particular, orthogonal arrays give the structure of the largest hypergraphs with second eigenvalue at most $1$ for every sufficiently large $r$. Moreover, we show that a generalized Moore geometry has the largest spectral gap among all hypergraphs of that order and degree.

math.CO↗
arXiv2021

An infinite class of Neumaier graphs and non-existence results

A Neumaier graph is a non-complete edge-regular graph containing a regular clique. A Neumaier graph that is not strongly regular is called a strictly Neumaier graph. In this work we present a new construction of strictly Neumaier graphs, and using Jacobi sums, we show that our construction produces infinitely many instances. Moreover, we prove some necessary conditions for the existence of (strictly) Neumaier graphs that allow us to show that several parameter sets are not admissible.

math.CO↗
arXiv2021

Sesqui-regular graphs with fixed smallest eigenvalue

Let $λ\geq2$ be an integer. For strongly regular graphs with parameters $(v, k, a,c)$ and smallest eigenvalue $-λ$, Neumaier gave two bounds on $c$ by using algebraic property of strongly regular graphs. In this paper, we will study a new class of regular graphs called sesqui-regular graphs, which contains strongly regular graphs as a subclass, and prove that for a sesqui-regular graph with parameters $(v,k,c)$ and smallest eigenvalue at least $-λ$, if $k$ is very large, then either $c \leq λ^2(λ-1)$ or $v-k-1 \leq \frac{(λ-1)^2}{4} + 1$ holds.

math.CO↗
arXiv2021

Sesqui-regular graphs with smallest eigenvalue at least $-3$

Koolen et al. showed that if a graph with smallest eigenvalue at least $-3$ has large minimal valency, then it is $2$-integrable. In this paper, we will focus on the sesqui-regular graphs with smallest eigenvalue at least $-3$ and study their integrability.

math.CO↗
arXiv2021

Maximality of Seidel matrices and switching roots of graphs

In this paper, we discuss maximality of Seidel matrices with a fixed largest eigenvalue. We present a classification of maximal Seidel matrices of largest eigenvalue $3$, which gives a classification of maximal equiangular lines in a Euclidean space with angle $\arccos1/3$. Motivated by the maximality of the exceptional root system $E_8$, we define strong maximality of a Seidel matrix, and show that every Seidel matrix achieving the absolute bound is strongly maximal.

math.CO↗
arXiv2020

Improving the Delsarte bound

In this paper, we study the order of a maximal clique in an amply regular graph with a fixed smallest eigenvalue by considering a vertex that is adjacent to some (but not all) vertices of the maximal clique. As a consequence, we show that if a strongly regular graph contains a Delsarte clique, then the parameter $μ$ is either small or large. Furthermore, we obtain a cubic polynomial that assures that a maximal clique in an amply regular graph is either small or large (under certain assumptions). Combining this cubic polynomial with the claw-bound, we rule out an infinite family of feasible parameters $(v,k,λ,μ)$ for strongly regular graphs. Lastly, we provide tables of parameters $(v,k,λ,μ)$ for nonexistent strongly regular graphs with smallest eigenvalue $-4, -5, -6$ or $-7$.

math.CO↗
arXiv2020

Recent progress on graphs with fixed smallest eigenvalue

We give a survey on graphs with fixed smallest eigenvalue, especially on graphs with large minimal valency and also on graphs with good structures. Our survey mainly consists of the following two parts: (i) Hoffman graphs, the basic theory related to Hoffman graphs and the applications of Hoffman graphs to graphs with fixed smallest eigenvalue and large minimal valency; (ii) recent results on distance-regular graphs and co-edge regular graphs with fixed smallest eigenvalue and the characterizations of certain families of distance-regular graphs. At the end of the survey, we also discuss signed graphs with fixed smallest eigenvalue and present some new findings.

math.CO↗
arXiv2020

Neumaier graphs with few eigenvalues

A Neumaier graph is a non-complete edge-regular graph containing a regular clique. In this paper we give some sufficient and necessary conditions for a Neumaier graph to be strongly regular. Further we show that there does not exist Neumaier graphs with exactly four distinct eigenvalues. We also determine the Neumaier graphs with smallest eigenvalue -2.

math.CO↗
arXiv2019

On the nonexistence of pseudo-generalized quadrangles

In this paper we consider the question of when a strongly regular graph with parameters $((s+1)(st+1),s(t+1),s-1,t+1)$ can exist. These parameters arise when the graph is derived from a generalized quadrangle, but there are other examples which do not arise in this manner, and we term these {\it pseudo-generalized quadrangles}. If the graph is a generalized quadrangle then $t \leq s^2$ and $s \leq t^2$, while for pseudo-generalized quadrangles we still have the former bound but not the latter. Previously, Neumaier has proved a bound for $s$ which is cubic in $t$, but we improve this to one which is quadratic. The proof involves a careful analysis of cliques and cocliques in the graph. This improved bound eliminates many potential parameter sets which were otherwise feasible.

math.CO↗
arXiv2019

A spectral characterization of the $s$-clique extension of the triangular graphs

A regular graph is co-edge regular if there exists a constant $μ$ such that any two distinct and non-adjacent vertices have exactly $μ$ common neighbors. In this paper, we show that for integers $s\ge 2$ and $n$ large enough, any co-edge-regular graph which is cospectral with the $s$-clique extension of the triangular graph $T((n)$ is exactly the $s$-clique extension of the triangular graph $T(n)$.

math.CO↗