Abstract
Let G = (V, E) be a connected graph and let M ⊆ V. For each u ∊ V the set fM (u) = {d(u, v) : v ∊ M} is called the distance pattern of u with respect to the set M. If fM is injective, then the set M is called a distance pattern distinguishing set (DPD-set) of G. If G admits a DPD-set, then G is called a DPD-graph. The minimum cardinality of a DPD-set in a DPD-graph G is the DPD-number of G and it is denoted by ρ(G). In this paper we present several fundamental results on these concepts and some family of graphs which admits DPD-set. We also investigate the relation between the DPD-number and the metric dimension of graphs and other graph theoretic parameters.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Discrete Mathematical Sciences and Cryptography
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
