In this chapter we systematically study various properties of the distance graph in Fdq, the d-dimensional vector space over the finite field Fq with q elements. In the process we compute the diameter of distance graphs and show that sufficiently large subsets of d-dimensional vector spaces over finite fields contain every possible finite configuration. © Springer Science+Business Media, LLC 2013.
CITATION STYLE
Hart, D., Iosevich, A., Koh, D., Senger, S., & Uriarte-Tuero, I. (2013). Distance Graphs in Vector Spaces Over Finite Fields. In Springer Proceedings in Mathematics and Statistics (Vol. 25, pp. 139–160). Springer New York LLC. https://doi.org/10.1007/978-1-4614-4565-4_14
Mendeley helps you to discover research relevant for your work.