Abstract
A vertex w ? V resolves two elements x, y ? V ? E if d(w,x) ? d(w,y). The mixed resolving set is a set of vertices S, S ? V if any two elements of E ? V are resolved by some element of S. The minimum cardinality of a mixed resolving set is called the mixed metric dimension of a graph G. This paper introduces three new general lower bounds for the mixed metric dimension of a graph. The exact values of mixed metric dimension for torus graph are determined using one of these lower bounds. Finally, some illustrative examples of these new lower bounds and those known in the literature are presented on a set of some well-known graphs.
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 callDisclaimer: 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.
