Jenis Dokumen
 Penulis Utama : Yuyun Mintarsih Penulis Tambahan : - NIM / NIP : M01 Tahun : 2018 Judul : On the strong metric dimension of antiprism graph, king graph, and Km ? Kn graph Edisi : Imprint : Surakarta - Matematika FMIPA UNS - 2018 Kolasi : Sumber : Hadiah Subyek : GRAP Jenis Dokumen : Makalah ISSN : ISBN : Abstrak : Abstract. Let G be a connected graph with a set of vertices V (G) and a set of edges E(G).The interval I[u; v] between u and v to be the collection of all vertices that belong to someshortest u-v path. A vertex s ∈ V (G) is said to be strongly resolved for vertices u, v ∈ V (G)if v ∈ I[u; s] or u ∈ I[v; s]. A vertex set S ⊆ V (G) is a strong resolving set for G if every twodistinct vertices of G are strongly resolved by some vertices of S. The strong metric dimensionof G, denoted by sdim(G), is de ned as the smallest cardinality of a strong resolving set. Inthis paper, we determine the strong metric dimension of an antiprism An graph, a king Km;ngraph, and a Km ? Kn graph. We obtain the strong metric dimension of an antiprim graphAn are n for n odd and n + 1 for n even. The strong metric dimension of King graph Km;n ism+n−1. The strong metric dimension of Km ?Kn graph are n for m = 1, n ≥ 1 and mn−1for m ≥ 2, n ≥ 1. File Dokumen : abstrak.pdfHarus menjadi member dan login terlebih dahulu untuk bisa download.Artikel_Yuyun Mintarsih_M0114064_2018.pdf File Jurnal : - Status : Public Pembimbing : 1. Tri Atmojo Kusmayadi Catatan Umum : Fakultas : Fak. MIPA