On the Transitivity of Gilbert Graphs and their Complements
Abstract The Gilbert graph $$\mathcal {G}_{q,n,d}$$ G q , n , d , which arises naturally in graph theory and coding theory, is the regular graph on $$\mathbb {F}_q^n$$ F q n in which two vertices are adjacent if their Hamming distance is less than d , and it is vertex-transitive. We classify all parameters ( q , n , d...
Noam Krupnik, Igal Sason, Abraham Berman
· Graphs and Combinatorics · 0 citations