Monitoring Edge-Geodetic Numbers of Mycielskian Graph Classes
Xin Li, Wen Li, Ao Tan, Mengmeng He, W. Chen · Journal of Interconnection Networks · 2024
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.