An algebraic distance graph is defined to be a graph with vertices in E n in which two vertices are adjacent if and only if the distance between them is an algebraic number. It is proved that an ...

For a given set M of positive integers, a well-known problem of Motzkin asked to determine the maximal asymptotic density of M-sets, denoted by μ(M), where an M-set is a set of non-negative integers ...

Distance-time graphs show how the distance travelled by a moving object changes with time. These graphs also show if the object is moving at a constant speed or accelerating, going back to the ...