Abstract
Given graphs G = (VG, EG) and H = (VH, EH), an ordered set U ⊆ VG is called a resolving set of G if coordinate of distances of every vertex in G to vertices in U is different. Metric dimension of G is the minimal cardinality of a resolving set of G. An edge-corona graph G ◊ H is obtained by joining end vertices of ej ∈ Eg, j ∈ {1, 2,…,|EG|} with all vertices from jth-copy of H. This paper discusses some characterization and exact values for metric dimension of edge-corona from a connected graph not tree G with an arbitrary nontrivial graph H.
Original language | English |
---|---|
Pages (from-to) | 965-978 |
Number of pages | 14 |
Journal | Far East Journal of Mathematical Sciences |
Volume | 102 |
Issue number | 5 |
DOIs | |
Publication status | Published - 2017 |
Keywords
- Edge-corona
- Metric dimension
- Resolving set