{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2017,11,21]],"date-time":"2017-11-21T05:40:10Z","timestamp":1511242810492},"reference-count":0,"publisher":"Dr. Soetomo University","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Jurnal Edukasi Pendidikan Matematika"],"abstract":"Let\ud835\udc3a(\ud835\udc49,\ud835\udc38)is a connected graph.For an ordered set \ud835\udc4a={\ud835\udc641,\ud835\udc642,\u2026,\ud835\udc64\ud835\udc58} of vertices, \ud835\udc4a\u2286\ud835\udc49(\ud835\udc3a), and a vertex \ud835\udc63\u2208\ud835\udc49(\ud835\udc3a), the representation of \ud835\udc63 with respect to \ud835\udc4a is the ordered k-tuple \ud835\udc5f(\ud835\udc63|\ud835\udc4a)={\ud835\udc51(\ud835\udc63,\ud835\udc641),\ud835\udc51(\ud835\udc63,\ud835\udc642),\u2026,\ud835\udc51(\ud835\udc63,\ud835\udc64\ud835\udc58)|\u2200\ud835\udc63\u2208\ud835\udc49(\ud835\udc3a)}. The set W is called a resolving set of G if every vertex of G has a distinct representation. A resolving set containing a minimum number of vertices is called a basis for \ud835\udc3a. The metric dimension of \ud835\udc3a, denoted by \ud835\udc51\ud835\udc56\ud835\udc5a(\ud835\udc3a), is the number of vertices in a basis of \ud835\udc3a. Then, for a subset S of V(G), the distance between u and S is \ud835\udc51(\ud835\udc63,\ud835\udc46)=\ud835\udc5a\ud835\udc56\ud835\udc5b{\ud835\udc51(\ud835\udc63,\ud835\udc65)|\u2200\ud835\udc65\u2208\ud835\udc46,\u2200\ud835\udc63\u2208\ud835\udc49(\ud835\udc3a)}. Let \u03a0=(\ud835\udc461,\ud835\udc462,\u2026,\ud835\udc46\ud835\udc59)be an ordered l-partition of V(G), for\u2200\ud835\udc46\ud835\udc59\u2282\ud835\udc49(\ud835\udc3a) dan\ud835\udc63\u2208\ud835\udc49(\ud835\udc3a), the representation of v with respect to \u03a0 is the l-vector \ud835\udc5f(\ud835\udc63|\u03a0)=(\ud835\udc51(\ud835\udc63,\ud835\udc461),\ud835\udc51(\ud835\udc63,\ud835\udc462),\u2026,\ud835\udc51(\ud835\udc63,\ud835\udc46\ud835\udc59)). The set \u03a0 is called a resolving partition for G if the \ud835\udc59\u2212vector \ud835\udc5f(\ud835\udc63|\u03a0),\u2200\ud835\udc63\u2208\ud835\udc49(\ud835\udc3a)are distinct. The minimum l for which there is a resolving l-partition of V(G) is the partition dimension of G, denoted by \ud835\udc5d\ud835\udc51(\ud835\udc3a). In this paper, we determine the metric dimension and the partition dimension of corona product graphs \ud835\udc3e\ud835\udc5b\u2a00\ud835\udc3e\ud835\udc5b\u22121, and we get some result that the metric dimension and partition dimension of \ud835\udc3e\ud835\udc5b\u2a00\ud835\udc3e\ud835\udc5b\u22121respectively is\ud835\udc5b(\ud835\udc5b\u22122) and 2\ud835\udc5b\u22121, for\ud835\udc5b\u22653.Keyword: Metric dimention, partition dimenstion,corona product graphs<\/jats:p>","DOI":"10.25139\/sm.v4i5.235","type":"journal-article","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T03:45:43Z","timestamp":1500522343000},"source":"Crossref","is-referenced-by-count":0,"title":["Dimensi Matriks Dan Dimensi Partisi Pada Graf Hasil Operasi Korona"],"prefix":"10.25139","volume":"4","author":[{"given":"Yuni","family":"Listiana","affiliation":[]}],"member":"10769","published-online":{"date-parts":[[2017,7,18]]},"container-title":["SOULMATH"],"original-title":[],"link":[{"URL":"http:\/\/ejournal.unitomo.ac.id\/index.php\/mipa\/article\/viewFile\/235\/140","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2017,11,21]],"date-time":"2017-11-21T05:24:44Z","timestamp":1511241884000},"score":1.0,"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,18]]},"references-count":0,"URL":"http:\/\/dx.doi.org\/10.25139\/sm.v4i5.235","relation":{},"ISSN":["2581-1290","2337-9421"],"issn-type":[{"value":"2337-9421","type":"print"},{"value":"2581-1290","type":"electronic"}]}}