Publications

Abstract : For a simple connected graph G = (V,E), let M ⊇ V and u ∈ V. The M-detour distance pattern of G is the set fM(u) = {D(u, v) : v ∈ M}. If fM is injective function, then the set M is a detour distance pattern distinguishing set (or, ddpd-set in short) of G. A graph G is defined as detour distance pattern distinguishing (or, ddpd-) graph if it admits a ddpd-set. The objective of this article is to initiate the study of graphs that admit marker set M for which fM is injective. This article establishes some general results on ddpd-graphs. © 2013 Academic Publications, Ltd.