Related papers: There exists no distance-regular graph with inters…
This article investigates the isomorphism problem for graphs derived from the four standard graph products: Cartesian, Kronecker (direct), strong, and lexicographic product. We provide a complete characterization of all simple connected…
In this paper, we consider the distance spectra of the derangement graphs. First we give a constructive proof that the connected derangement graphs are of diameter 2. Then we obtain their distance spectra. In particular, we determine all…
The Steiner distance of a graph, introduced by Chartrand, Oellermann, Tian and Zou in 1989, is a natural generalization of the concept of classical graph distance. For a connected graph $G$ of order at least $2$ and $S\subseteq V(G)$, the…
This paper concerns $(r,c)$-constant graphs, which are $r$-regular graphs in which the subgraph induced by the open neighbourhood of every vertex has precisely $c$ edges. The family of $(r,c)$-graphs contains vertex-transitive graphs (and…
We consider the setting of Reeb graphs of piecewise linear functions and study distances between them that are stable, meaning that functions which are similar in the supremum norm ought to have similar Reeb graphs. We define an edit…
In this note, we provide a proof of a technical result of Erd\H{o}s and Hajnal about the existence of disjoint type graphs with no odd cycles. We also prove that this result is sharp in a certain sense.
How many graphs on an $n$-point set can we find such that any two have connected intersection? Berger, Berkowitz, Devlin, Doppelt, Durham, Murthy and Vemuri showed that the maximum is exactly $1/2^{n-1}$ of all graphs. Our aim in this short…
For $k\ge 1$, the $k$-independence number $\alpha_k$ of a graph is the maximum number of vertices that are mutually at distance greater than $k$. The well-known inertia and ratio bounds for the (1-)independence number $\alpha(=\alpha_1)$ of…
In a proximity region graph ${\cal G}$ in $\mathbb{R}^d$, two distinct points $x,y$ of a point process $\mu$ are connected when the 'forbidden region' $S(x,y)$ these points determine has empty intersection with $\mu$. The Gabriel graph,…
In this paper we determine the unique graph with minimum distance spectral radius among all connected graphs of fixed order and given edge connectivity.
Amply regular graphs are graphs with local distance-regularity constraints. In this paper, we prove a weaker version of a conjecture proposed by Qiao, Park, and Koolen on diameter bounds of amply regular graphs and make new progress on…
We prove that all $1$-vertex spatial graphs with adequate diagrams have minimal crossing number, and that spatial graph diagrams obtained by replacing vertices and edges of a planar embedded graph by minimal crossing link or spatial graph…
In [Distrance-regular Cayley graphs on dihedral groups, J. Combin. Theory Ser B 97 (2007) 14--33], Miklavi\v{c} and Poto\v{c}nik proposed the problem of characterizing distance-regular Cayley graphs, which can be viewed as an extension of…
In this paper we propose and study a new structural invariant for graphs, called distance-unbalanced\-ness, as a measure of how much a graph is (un)balanced in terms of distances. Explicit formulas are presented for several classes of…
If a vertex in a graph can be deleted without affecting distances among the other vertices, we shall say it is distance-redundant. Graphs with all, some or no such vertices are discussed. (The latter class was termed distance-critical by…
We study limits of convergent sequences of string graphs, that is, graphs with an intersection representation consisting of curves in the plane. We use these results to study the limiting behavior of a sequence of random string graphs. We…
For any graph $G = (V,E)$ and positive integer $d$, the exact distance-$d$ graph $G_{=d}$ is the graph with vertex set $V$, where two vertices are adjacent if and only if the distance between them in $G$ is $d$. We study the exact…
In this paper we prove the Bannai-Ito conjecture, namely that there are only finitely many distance-regular graphs of fixed valency greater than two.
We introduce and develop a theory of limits for sequences of sparse graphs based on $L^p$ graphons, which generalizes both the existing $L^\infty$ theory of dense graph limits and its extension by Bollob\'as and Riordan to sparse graphs…
In this paper we construct distance-regular graphs admitting a transitive action of the five sporadic simple groups discovered by E. Mathieu, the Mathieu groups $M_{11}$, $M_{12}$, $M_{22}$, $M_{23}$ and $M_{24}$. From the code spanned by…