Abstract

Let be a connected graph. The distance between an edge and a vertex is defined as A nonempty set is an edge metric generator for if for any two distinct edges , there exists a vertex such that . An edge metric generating set with the smallest number of elements is called an edge metric basis of , and the number of elements in an edge metric basis is called the edge metric dimension of and it is denoted by . In this paper, we study the edge metric dimension of a blow up of a graph , and also we study the edge metric dimension of the zero divisor graph of the ring of integers modulo . Moreover, the Wiener index and the hyper-Wiener index of the blow up of certain graphs are computed.

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 call

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.