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

Abstract

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 (ð‘ƒð‘›) anf circle graph (ð¶ð‘š). The corona product ð‘ƒð‘› ⨀ð¶ð‘š is defined as the graph obtained from ð‘ƒð‘›and ð¶ð‘š by taking one copi of ð‘ƒð‘› and ð‘š1copies of ð¶ð‘š and joining by an edge each vertex from the ð‘›ð‘¡â„Ž copy of ð‘ƒð‘› with the ð‘šð‘¡â„Ž vertex of ð¶ð‘š. ð‘ƒð‘› ⨀ ð¶ð‘š and ð¶ð‘šâ¨€ð‘ƒð‘› not commute to ð‘›â‰ ð‘š, it is showed that order of graph ð‘ƒð‘› ⨀ ð¶ð‘š different with graph ð¶ð‘šâ¨€ð‘ƒð‘›. Based on research obtained ð‘‘ð‘–ð‘š(ð‘ƒð‘›â¨€ð¶ð‘š)=ð‘›.ð‘‘ð‘–ð‘š(ð‘Š1,ð‘š) dan ð‘‘ð‘–ð‘š(ð¶ð‘šâ¨€ð‘ƒð‘›)=ð‘š.ð‘‘ð‘–ð‘š (ð¾1+ð‘ƒð‘›)
Keyword : Resolving Sets, Metric Dimension, Path Graph, Circle Graph, Corona Graph