Abstract
Let \(P\) be a set of \(n\) points in the plane. A geometric graph \(G\) on \(P\) is said to be locally Gabriel if for every edge \((u,v)\) in \(G\), the Euclidean disk with the segment joining \(u\) and \(v\) as diameter does not contain any points of \(P\) that are neighbors of \(u\) or \(v\) in \(G\). A locally Gabriel graph(LGG) is a generalization of Gabriel graph and is motivated by applications in wireless networks. Unlike a Gabriel graph, there is no unique LGG on a given point set since no edge in a LGG is necessarily included or excluded. Thus the edge set of the graph can be customized to optimize certain network parameters depending on the application. The unit distance graph(UDG), introduced by Erdos, is also a LGG. In this paper, we show the following combinatorial bounds on edge complexity and independent sets of LGG: (i) For any \(n\), there exists LGG with \(\Omega (n^{5/4})\) edges. This improves upon the previous best bound of \(\Omega (n^{1+\frac{1}{\log \log n}})\). (ii) For various subclasses of convex point sets, we show tight linear bounds on the maximum edge complexity of LGG. (iii) For any LGG on any \(n\) point set, there exists an independent set of size \(\Omega (\sqrt{n}\log n)\).
Similar content being viewed by others
References
Ábrego, B.M., Fernández-Merchant, S.: The unit distance problem for centrally symmetric convex polygons. Discrete Comput. Geom. 28(4), 467–473 (2002)
Alon, N.: Independence numbers of locally sparse graphs and a ramsey type problem. Random Struct. Algorithms 9(3), 271–278 (1996)
Bose, P., et al.: Routing with guaranteed delivery in ad hoc wireless networks. In: Proceedings of the 3rd International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 48–55. ACM, New York, USA (1999)
Brass, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry. Springer, Berlin (2005)
Braß, P., Pach, J.: The maximum number of times the same distance can occur among the vertices of a convex n-gon is n log n. J. Comb. Theory, Ser. A 94(1), 178–179 (2001)
Edelsbrunner, H., Hajnal, P.: A lower bound on the number of unit distances between the vertices of a convex polygon. J. Comb. Theory, Ser. A 56(2), 312–316 (1991)
Erdos, P.: On sets of distances of n points. Am. Math. Mon. 53, 248–250 (1946)
J. Comb. Theory Ser. A The maximum number of unit distances in a convex n-gon. 55(2), 316–320 (1990)
Gabriel, R.K., Sokal, R.R.: A new statistical approach to geographic variation analysis. Syst. Zool. 18(3), 259–278 (1969)
Hunt, J.W., Szymanski, T.G.: A fast algorithm for computing longest common subsequences. Commun. ACM 20, 350–353 (1977)
Jaromczyk, J., Toussaint, G.: Relative neighborhood graphs and their relatives. P-IEEE 80, 1502–1517 (1992)
Kapoor, S., Li, X.-Y.: Proximity structures for geometric graphs. Int. J. Comp. Geom. Appl. 20, 415–429 (2010)
Li, X.-Y., et al.: Distributed construction of a planar spanner and routing for ad hoc wireless networks. IEEE INFOCOM, 1268–1277 (2002)
Pinchasi, R., Smorodinsky, S.: On locally delaunay geometric graphs. In: Symposium on Computational Geometry, pp. 378–382 (2004)
Székely, L.A.: Crossing numbers and hard erdos problems in discrete geometry. Comb. Probab. Comput. 6(3), 353–358 (1997)
Szemerédi, E., Trotter, W.: Extremal problems in discrete geometry. Combinatorica 3, 381–392 (1983)
Urrutia, J.: Local solutions for global problems in wireless networks. Journal of Discrete Algorithms 5, 395–407 (2007)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Govindarajan, S., Khopkar, A. On Locally Gabriel Geometric Graphs. Graphs and Combinatorics 31, 1437–1452 (2015). https://doi.org/10.1007/s00373-014-1482-5
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-014-1482-5