Abstract

Let [Formula: see text] be a graph and [Formula: see text] be the vertex set of [Formula: see text]. If any edge appears in the unique shortest path of at least one vertex pair in set [Formula: see text], then [Formula: see text] is defined as the monitoring edge-geodetic set (MEG-set for short). We denote by [Formula: see text] the size of a smallest MEG-set of [Formula: see text]. In this paper, we studied the monitoring edge-geodetic numbers of Mycielski graph classes.

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.