Distance magic graph admits a distance magic labeling, whereas the distance antimagic graph admits a distance antimagic labeling. This chapter discusses the existence of distance magic labeling and distance antimagic labeling for a specific function. It considers that all graphs with a specific vertex set and a specific edge set are finite and simple. Bijection involves distance magic labeling of a graph of order n. The constant in the bijection is called the magic constant of the distance magic labeling for the specific function. The concept of distance magic labeling was introduced and studied by many researchers with different terminologies.