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