On metric dimension of edge-corona graphs

Rinurwati, Herry Suprajitno, Slamin

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)


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 languageEnglish
Pages (from-to)965-978
Number of pages14
JournalFar East Journal of Mathematical Sciences
Issue number5
Publication statusPublished - 2017


  • Edge-corona
  • Metric dimension
  • Resolving set


Dive into the research topics of 'On metric dimension of edge-corona graphs'. Together they form a unique fingerprint.

Cite this