A lower bound for 4-regular planar unit distance graphs
نویسنده
چکیده
We perform an exhaustive search for the minimum 4-regular unit distance graph resulting in a lower bound of 34 vertices.
منابع مشابه
Lower Bounds for Interval Routing on BoundedDegree
Interval Routing was introduced to reduce the size of the routing tables: a router nds the direction to forward a message by determining the interval that contains the destination address of the message, each interval being associated to one particular direction. In this paper, we give lower bounds for the minimum number of intervals per edge needed to achieve shortest path routing for the clas...
متن کاملOn the Diameter and Some Related Invariants of Fullerene Graphs∗
Fullerene graphs are 3-connected 3-regular planar graphs with only pentagonal and hexagonal faces. We show that the diameter of a fullerene graph G of order n is at least √ 24n−15−3 6 and at most n/5 + 1. Moreover, if G is not a (5, 0)-nanotube its diameter is at most n/6+5/2. As a consequence, we improve the upper bound on the saturation number of fullerene graphs. We also report an improved l...
متن کاملValency of Distance-regular Antipodal Graphs with Diameter 4
Let G be a non-bipartite strongly regular graph on n vertices of valency k. We prove that if G has a distance-regular antipodal cover of diameter 4, then k ≤ 2(n + 1)/5 , unless G is the complement of triangular graph T (7), the folded Johnson graph J (8, 4) or the folded halved 8-cube. However, for these three graphs the bound k ≤ (n − 1)/2 holds. This result implies that only one of a complem...
متن کاملNear-Optimal Compression for the Planar Graph Metric
The Planar Graph Metric Compression Problem is to compactly encode the distances among k nodes in a planar graph of size n. Two naïve solutions are to store the graph using Opnq bits, or to explicitly store the distance matrix with Opk log nq bits. The only lower bounds are from the seminal work of Gavoille, Peleg, Prennes, and Raz [SODA’01], who rule out compressions into a polynomially smalle...
متن کاملBall packings with high chromatic numbers from strongly regular graphs
Inspired by Bondarenko’s counter-example to Borsuk’s conjecture, we notice some strongly regular graphs that provide examples of ball packings whose chromatic numbers are significantly higher than the dimensions. In particular, from generalized quadrangles we obtain unit ball packings in dimension q3 − q2 + q with chromatic number q3 + 1, where q is a prime power. This improves the previous low...
متن کامل