Abstract

Let $C_n, L_{m,n}$ denote Cycle graph on $n$ vertices, Lollipop graph on $m + n$ vertices. In this article, we examine the distance graphs $G(C_n,D)$, $G(L_{m,n},D)$, where $D$ is the difference set. We characterize the distance set $D$ for the above graphs is one of wheel,regular, cycle, acyclic, bipartite, path.

Keywords and Phrases

Distance graph, Complete graph, Cycle, Wheel graph, Complete bipartite graph.

A.M.S. subject classification

05C12.

.....