On the Distance Pattern Distinguishing Number of a Graph
Let G=(V,E) be a connected simple graph and let M be a nonempty subset of V. The M-distance pattern of a vertex u in G is the set of all distances from u to the vertices in M. If the distance patterns of all vertices in V are distinct, then the set M is a distance pattern distinguishing set of G. A...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2014/328703 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|