Related papers: There exists no distance-regular graph with inters…
We consider several classes of intersection graphs of line segments in the plane and prove new equality and separation results between those classes. In particular, we show that: (1) intersection graphs of grounded segments and intersection…
We prove that there exists an infinite family of 4-regular 4-connected Hamiltonian graphs with a bounded number of Hamiltonian cycles. We do not know if there exists such a family of 5-regular 5-connected Hamiltonian graphs.
We study criteria attesting that a given graph can not be embedded in the plane so that neighboring vertices are at unit distance apart and the straight line edges do not cross.
A $t$-walk-regular graph is a graph for which the number of walks of given length between two vertices depends only on the distance between these two vertices, as long as this distance is at most $t$. Such graphs generalize distance-regular…
We construct a new family of distance-biregular graphs related to hyperovals and a new sporadic example of a distance-biregular graph related to Mathon's perp system. The infinite family can be explained using 2-$\bipartB$-homogeneity,…
We study the parameterized complexity of dominating sets in geometric intersection graphs. In one dimension, we investigate intersection graphs induced by translates of a fixed pattern Q that consists of a finite number of intervals and a…
Let $G$ denote a $Q$-polynomial distance-regular graph with diameter $D$ at least 4. Assume that the intersection numbers of $G$ satisfy $a_i=0$ for $0 \leq i \leq D-1$ and $a_D\neq 0$. We show that $G$ is a polygon, a folded cube, or an…
Erd\H{o}s and Lov\'asz noticed that an $r$-uniform intersecting hypergraph $H$ with maximal covering number, that is $\tau(H)=r$, must have at least $\frac{8}{3}r-3$ edges. There has been no improvement on this lower bound for 45 years. We…
A nut graph is a simple graph whose adjacency matrix is singular with $1$-dimensional kernel such that the corresponding eigenvector has no zero entries. In 2020, Fowler et al. characterised for each $d \in \{3,4,\ldots,11\}$ all values $n$…
As observed by Rautenbach and Sereni (arXiv:1302.5503) there is a gap in the proof of the theorem of Balister et al. (Longest paths in circular arc graphs, Combin. Probab. Comput., 13, No. 3, 311-317 (2004)), which states that the…
Grid intersection graphs are the intersection graphs of vertical and horizontal segments in the plane. When the bottom and respectively left endpoints of the vertical and horizontals segments belong to a line with negative slope, the graph…
Twin-width is a recently introduced graph parameter for finite graphs. It is an open problem to determine whether there is an $n$-vertex graph having twin-width at least $n/2$ (due to J. Ahn, K. Hendrey, D. Kim and S. Oum). In an earlier…
A matchstick graph is a graph drawn with straight edges in the plane such that the edges have unit length, and non-adjacent edges do not intersect. We call a matchstick graph $(m;n)$-regular if every vertex has only degree $m$ or $n$. In…
In this paper, we construct an infinite family of normal Cayley graphs, which are $2$-distance-transitive but neither distance-transitive nor $2$-arc-transitive. This answers a question raised by Chen, Jin and Li in 2019 and corrects a…
In this paper, we derive new sharp diameter bounds for distance regular graphs, which better answer a problem raised by Neumaier and Penji\' c in many cases. Our proof is built upon a relation between the diameter and long-scale Ollivier…
A balanced graph is a bipartite graph with no induced circuit of length 2 mod 4. These graphs arise in linear programming. We focus on graph-algebraic properties of balanced graphs to prove a complete classification of balanced Cayley…
We consider the following feasibility problem: given an integer $n \geq 1$ and an integer $m$ such that $0 \leq m \leq \binom{n}{2}$, does there exist a line graph $L = L(G)$ with exactly $n$ vertices and $m$ edges ? We say that a pair…
In this paper, we study distance-regular graphs $\Gamma$ that have a pair of distinct vertices, say x and y, such that the number of common neighbors of x and y is about half the valency of $\Gamma$. We show that if the diameter is at least…
A {\em resolving set} for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$. The {\em metric dimension} of $\Gamma$ is the…
An interval graph is the intersection graph of a finite set of intervals on a line and a circular-arc graph is the intersection graph of a finite set of arcs on a circle. While a forbidden induced subgraph characterization of interval…