Abstract
Given a connected graph G=(V,E), a set of vertices S⊂V is an edge metric generator for G, if any two edges of G are identified by S by mean of distances to the vertices in S. Moreover, in a natural way, S is a mixed metric generator, if any two elements of G (vertices or edges) are identified by S by mean of distances. In this work we study the (edge and mixed) metric dimension of graphs.
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.
