IMPLEMENTASI ALGORITMA MODIFIKASI BROYDEN-FLETCHER-GOLDFARB-SHANNO (MBFGS)

Main Author: Standsyah, Rahmawati Erma
Format: Article info application/pdf eJournal
Bahasa: ind
Terbitan: Universitas Dr. Soetomo , 2017
Subjects:
Online Access: http://ejournal.unitomo.ac.id/index.php/mipa/article/view/231
http://ejournal.unitomo.ac.id/index.php/mipa/article/view/231/137
Daftar Isi:
  • The concept of minimum resolving set has proved to be useful and or related to a variety of fields such as Chemistry, Robotic Navigation, and Combinatorial Search and Optimization. Two graph are path graph (Pn) anf circle graph (Cm). The corona product Pn ⨀Cm is defined as the graph obtained from Pnand Cm by taking one copi of Pn and m1copies of Cm and joining by an edge each vertex from the nth copy of Pn with the mth vertex of Cm. Pn ⨀ Cm and Cm⨀Pn not commute to n≠m, it is showed that order of graph Pn ⨀ Cm different with graph Cm⨀Pn. Based on research obtained dim(Pn⨀Cm)=n.dim(W1,m) dan dim(Cm⨀Pn)=m.dim (K1+Pn)Keyword : Resolving Sets, Metric Dimension, Path Graph, Circle Graph, Corona Graph