Name
Abstract | ||
|---|---|---|
A subset W of vertices of a graph G is called a resolving set for G if for every pair of distinct vertices {u, v} is an element of V(G), there exists a vertex w is an element of W such that the distance between u and w is different from the distance between v and w. A resolving set containing minimum number of vertices is called a metric basis for G, and the number of vertices in a metric basis is called the metric dimension of G, denoted by beta(G). In this paper, we prove that the circulant graphs C(n; {1, 4}) have bounded metric dimension, and they constitute a family of graphs with constant metric dimension. |
Year | Venue | Keywords |
|---|---|---|
2018 | ARS COMBINATORIA | resolving set,metric basis,metric dimension,circulant graph |
Field | DocType | Volume |
Discrete mathematics,Circulant matrix,Mathematics | Journal | 136 |
ISSN | Citations | PageRank |
0381-7032 | 0 | 0.34 |
References | Authors | |
1 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Muhammad Azhar | 1 | 47 | 4.54 |
| Imran Javaid | 2 | 10 | 6.37 |