Abstract
To determine the vertices of a connected graph through distance, many parameters are formed by varying the concept of metric generator in graph theory, such as connected metric generator, independent metric generator, doubly metric generator, strong metric generator, local metric generator and fault-tolerant metric generator to name a few. In this paper we determining every two neighbors in two families of Cayley graphs by investigating their local metric generator and fault-tolerant local metric generator.
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.
