Abstract
Foucard, Krishna and Lekshmi introduced a new graph-theoretic concept in the area of network monitoring. Let G be a graph with vertex set , there exists a subset , if deleting any edge in G, one can find that there exist at least two vertices in S whose distance is changed, then we call S is a monitoring edge-geodetic set (MEG-set for short). The minimum size of the MEG-set of G is called the monitoring edge-geodetic number of G (meg(G) for short). In this paper, we study the monitoring edge-geodetic number of some well-known networks, including Ladder, butterfly, circulant and Benes networks and convex polytopes.
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 callMore From: International Journal of Parallel, Emergent and Distributed Systems
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.
