cycle transit function and betweenness

Transit functions are introduced to study betweenness, intervals and con vexity in an axiomatic setup on graphs and other discrete structures. prime example of a transit function on graphs is the well studied interval function of a connected graph. in this paper, we study the cycle transit function c(u, v) on graphs which is a transit function derived from the interval function. we study the betweenness properties and also characterize graphs in which the cycle transit function coincides with the interval function. we also characterize graphs where |c(u, v) ∩ c(v, w) ∩ c(u, w)| ≤ 1 as an analogue of median graphs.