Abstract
Let G be a graph is a finite set of vertices and edges. A graph G can be defined as a pair of sets . The minimum cardinality of all distinguishing sets in a graph is called the metric dimension. The metric dimension was first introduced in 1966 by Harary and Melter. The method used in this research is deductive proof. The results obtained from this research are we determine the metric dimension of the graph resulting from the corona operation on and obtain the result that is 2n.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callSimilar Papers
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
