Weakly toll convexity and proper interval graphs
share
A walk u_0u_1 … u_k-1u_k is a weakly toll walk if u_0u_i ∈ E(G) implies u_i = u_1 and u_ju_k∈ E(G) implies u_j=u_k-1. A set S of vertices of G is weakly toll convex if for any two non-adjacent vertices x,y ∈ S any vertex in a weakly toll walk between x and y is also in S. The weakly toll convexity is the graph convexity space defined over weakly toll convex sets. Many studies are devoted to determine if a graph equipped with a convexity space is a convex geometry. An extreme vertex is an element x of a convex set S such that the set S\{x} is also convex. A graph convexity space is said to be a convex geometry if it satisfies the Minkowski-Krein-Milman property, which states that every convex set is the convex hull of its extreme vertices. It is known that chordal, Ptolemaic, weakly polarizable, and interval graphs can be characterized as convex geometries with respect to the monophonic, geodesic, m^3, and toll convexities, respectively. Other important classes of graphs can also be characterized in this way. In this paper, we prove that a graph is a convex geometry with respect to the weakly toll convexity if and only if it is a proper interval graph. Furthermore, some well-known graph invariants are studied with respect to the weakly toll convexity.
READ FULL TEXT