On the transitivity of Gilbert graphs and their complements
Noam Krupnik, Igal Sason, Abraham Berman

TL;DR
This paper classifies when Gilbert graphs and their complements are edge- or distance-transitive, revealing precise conditions and applying spectral methods to analyze their symmetry properties and compute Lovász theta functions.
Contribution
It provides a complete classification of transitivity properties for Gilbert graphs and their complements, including spectral analysis and exact Lovász theta function calculations.
Findings
Gilbert graphs are edge- and distance-transitive only for specific parameters.
Complement graphs' transitivity depends on spectral properties and differs from Gilbert graphs.
Exact Lovász theta functions are computed for cases with transitivity.
Abstract
The Gilbert graph , which arises naturally in graph theory and coding theory, is the regular graph on in which two vertices are adjacent if their Hamming distance is less than , and it is vertex-transitive. We classify all parameters for which is edge-transitive or distance-transitive, and separately classify all parameters for which its complement has these properties. We prove that is edge-transitive if and only if it is distance-transitive, and that this occurs precisely when , , or . For the complement graphs, we determine all parameters yielding edge- or distance-transitivity using spectral methods based on Krawtchouk polynomials and the structure of the Hamming association scheme. In contrast to the Gilbert graphs, where the parameter sets…
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 theory and applications · Finite Group Theory Research · Graph Labeling and Dimension Problems
