On the monophonic convexity number of the complementary prisms
share
A set S of vertices of a graph G is monophonic convex if S contains all the vertices belonging to any induced path connecting two vertices of S. The cardinality of a maximum proper monophonic convex set of G is called the monophonic convexity number of G. The complementary prism GG̅ of G is obtained from the disjoint union of G and its complement G̅ by adding the edges of a perfect matching between them. In this work, we determine the monophonic convexity number of the complementary prisms of all graphs.
READ FULL TEXT