Abstract
In this paper, the authors analysed metric dimensions of arbitrary graphs G★˜∧i=1|V(G)|Hi in which graphs G,H1,H2,…,H|V(G)| are non-trivial, G is connected, and ★˜ denotes generalized neighborhood corona operation. We found lower bounds of dim(G★˜∧i=1|V(G)|Hi) as function of dimA(Hi) where dimA(Hi) denotes adjacency metric dimensions of Hi. We also found upper bounds of dim(G★˜∧i=1|V(G)|Hi) when G does not contain pair of false twin vertices. Furthermore, we found a characteristic of dim(G★˜∧i=1|V(G)|Hi) which indicates that our lower bounds are strict.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.