On the metric dimension of incidence graph of M\"obius planes
\'Akos Beke

TL;DR
This paper investigates the metric dimension and split-resolving sets of the point-circle incidence graph of M"obius planes, providing bounds and properties related to their sizes and structures.
Contribution
It establishes bounds on the metric dimension, split-resolving sets, and blocking sets of M"obius planes, advancing understanding of their combinatorial properties.
Findings
Metric dimension of M"obius plane of order q is approximately 2q.
Optimal split-resolving set size is between 5q and 2.5q log q.
Smallest blocking set has at most 2q(1 + log(q + 1)) points.
Abstract
We study the metric dimension and optimal split-resolving sets of the point-circle incidence graph of a M\"obius plane. We prove that the metric dimension of a M\"obius plane of order is around , and that an optimal split-resolving set has cardinality between approximately and . We also prove that a smallest blocking set of a M\"obius plane of order has at most points.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · graph theory and CDMA systems
