IJPAM: Volume 87, No. 5 (2013)
Amrita School of Engineering
Amrita Vishwa Vidyapeetham
Coimbatore, 641 112, Tamil Nadu, INDIA
Abstract. For a simple connected graph let and The -detour distance pattern of is the set If is injective function, then the set is a detour distance pattern distinguishing set (or, ddpd- set in short) of A graph 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 for which is injective. This article establishes some general results on ddpd-graphs.
Received: April 9, 2013
AMS Subject Classification: 05C22
Key Words and Phrases: detour distance, detour distance pattern, detour distance pattern distinguishing set
Download paper from here.
DOI: 10.12732/ijpam.v87i5.5 How to cite this paper?
Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395