Related papers: Small unit-distance graphs in the plane
A graph with n vertices is 1-planar if it can be drawn in the plane such that each edge is crossed at most once, and is optimal if it has the maximum of 4n-8 edges. We show that optimal 1-planar graphs can be recognized in linear time. Our…
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 show that every 1-planar graph with minimum degree at least 4 has girth at most $8$, and every 1-planar graph with minimum degree at least 3 has girth at most $198$.
A graph $H$ is an \emph{isometric} subgraph of $G$ if $d_H(u,v)= d_G(u,v)$, for every pair~$u,v\in V(H)$. A graph is \emph{distance preserving} if it has an isometric subgraph of every possible order. A graph is \emph{sequentially distance…
In this paper we obtain new estimates of the number of edges in subgraphs of the special distance graph. Bibliography: 21 item.
A 1-plane graph is a graph together with a drawing in the plane in such a way that each edge is crossed at most once. A 1-plane graph is maximal if no edge can be added without violating either 1-planarity or simplicity. Let $m(n)$ denote…
The concept of pseudo-distance-regularity around a vertex of a graph is a natural generalization, for non-regular graphs, of the standard distance-regularity around a vertex. In this note, we prove that a pseudo-distance-regular graph…
Define a boundary point of a graph which is embedded in the Euclidean plane a vertex which is incident to only one edge. In this paper we consider graphs which are embedded in the Euclidean plane with a finite number of boundary points. The…
We create the unlabeled or vertex-labeled graphs with up to 10 edges and up to 10 vertices and classify them by a set of standard properties: directed or not, vertex-labeled or not, connectivity, presence of isolated vertices, presence of…
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…
It has been known since 1991 that the problem of recognizing grid intersection graphs is NP-complete. Here we use a modified argument of the above result to show that even if we restrict to the class of unit grid intersection graphs…
For any $\varepsilon \in (0,+\infty)$, consider the metric spaces $\mathbb{R} \times [0,\varepsilon]$ in the Euclidean plane named layers or strips. B. Baslaugh in 1998 found the minimal width $\varepsilon \in (0,1)$ of a layer such that…
We prove distance bounds for graphs possessing positive Bakry-\'Emery curvature apart from an exceptional set, where the curvature is allowed to be non-positive. If the set of non-positively curved vertices is finite, then the graph admits…
The main result of this paper is that for any $c>0$ and for large enough $n$ if the number of edges in a 3-uniform hypergraph is at least $cn^2$ then there is a core (subgraph with minimum degree at least 2) on at most 15 vertices. We…
We show that every outerplanar graph $G$ can be linearly embedded in the plane such that the number of distinct distances between pairs of adjacent vertices is at most thirteen and there is no intersection between the image of a vertex and…
For a simple graph $G$, the $3$-distance graph, $D_3(G)$, is a graph with the vertex set $V(G)$ and two vertices are adjacent if and only if their distance is $3$ in the graph $G$. For a connected graph $G$, we provide some conditions for…
We say that a metric graph is uniformly bounded if the degrees of all vertices are uniformly bounded and the lengths of edges are pinched between two positive constants; a metric space is approximable by a uniform graph if there is one…
We study here the graphs with seven vertices in an effort to classify which of them appear as the prime character degree graphs of finite solvable groups. This classification is complete for the disconnected graphs. Of the 853…
An interval graph is considered improper if and only if it has a representation such that an interval contains another interval. Previously these have been investigated in terms of balance and minimal forbidden interval subgraphs for the…
We consider unitary graphs attached to Z_d^n using an analogue of the Euclidean distance. These graphs are shown to be integral when n is odd or the dimension d is even.