- Title
- On the partition dimension of circulant graphs
- Creator
- Grigorious, Cyriac; Stephen, Sudeep; Rajan, Bharati; Miller, Mirka
- Relation
- Computer Journal Vol. 60, Issue 2, p. 180-184
- Publisher Link
- http://dx.doi.org/10.1093/comjnl/bxw079
- Publisher
- Oxford University Press
- Resource Type
- journal article
- Date
- 2017
- Description
- For a vertex v of a connected graph G (V, E) and a subset S of V, the distance between v and S is defined by d(v,S)=min{d(v,x):x∈S}. For an ordered k.-partition Π={S1,S2,…,Sk} of V, the representation of v with respect to Π is the k-vector r(v∣Π)=(d(v,S1),d(v,S2),…,d(v,Sk)). The k-partition Π is a resolving partition if the k-vectors r(v∣Π), v∈V are distinct. The minimum k for which there is a resolving k-partition of V is the partition dimension of G. In this paper, we obtain the partition dimension of circulant graphs [formula cannot be replicated]
- Subject
- circulant graphs; metric dimension; partition dimension
- Identifier
- http://hdl.handle.net/1959.13/1355707
- Identifier
- uon:31515
- Identifier
- ISSN:0010-4620
- Language
- eng
- Reviewed
- Hits: 959
- Visitors: 918
- Downloads: 0
| Thumbnail | File | Description | Size | Format |
|---|