Abstract
For example, G is a connected graph and W is a subset of the set of points V on G. Set W is called the determining set on G if every point on G has different representations towards W. A determining set with a minimum number of members is called a minimum determining set or the basis of G and the cardinality of the minimum determinant set represents the metric dimension of the graph G. And denoted by dim(G). This paper discusses the metric dimensions of modified hourglass graphs mHgn constructed from a complete graph K1 with graphs Cn. Based on the results of the discussion, it was found that dim (mHgn) with m ≥ 3 and 3 ≤ n ≤ 5 is 2m.
Sign-in/Register to access full text options 
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 callMore From: International Journal of Innovative Science and Research Technology (IJISRT)
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.
