Research Article
On the Distance Pattern Distinguishing Number of a Graph
| dpd function () | | { | | # dimension of | | | | | # outer loop for times | | | { | | | | # inner loop for sub matrices | | | | { | | | | | | # sub matrix of columns | | | | { | | # checking distinct rows | | | | { | | | | | | && | | { | | | | } | | } | | } | | | | { | | | | } | | | { | | # find dpd set | | (“is a distance pattern distinguishing set”) | | | | } | | | } | | | } | | | { | | (“Given graph has no distance pattern distinguishing sets”) | | } | | (“distance pattern distinguishing number is”) # find dpd number | | | } |
|
