On Geodesic Convexity in Mycielskian of Graphs

The convexity induced by the geodesics in a graph G is called the geodesic convexity of G . Mycielski graphs preserve the property of being triangle-free and many parameters such as power domination number, coloring number, determining number and recently general position number have been determined for them. In this work, we determine the geodesic convexity parameters viz., convexity, geodetic iteration, geodetic, and hull numbers for Mycielski graphs for which the underlying graphs considered are path, cycle, star, and complete graph.