ON DISTANCE PATTERN SEGREGATED GRAPHS

Abstract

Labeled graphs are becoming an increasingly useful family of mathematical models for a wide range of applications. A new graph labelling scheme is introduced in this paper. We define distance pattern segregated graphs as follows. A graph G is called a distance pattern segregated graph, if f_M(u) is independent of the choice of  and injective  when restricted to the set V-M. The set M is called the distance pattern segregated set for G. The least cardinality of the DPS set of a graph G is called the DPS number of G.