Abstract
A transit function R on a set V is a function \(R:VxV \to 2^2 \) satisfying the axioms \(u \in R(u,\upsilon ),R(u,\upsilon ) = R(\upsilon ,u)\) and \(R(u,u) = \{ u\} \), for all \(u,\upsilon \in V\). The all-paths transit function of a connected graph is characterized by transit axioms.
Similar content being viewed by others
References
P. Duchet: Convexity in combinatorial structures. Rend. Circ. Mat. Palermo (2) Suppl. 14 (1987), 261–293.
P. Duchet: Convex sets in graphs II. Minimal path convexity. J. Combin. Theory Ser. B 44 (1988), 307–316.
J. Calder: Some elementary properties of interval convexities. J. London Math. Soc.3 (1971), 422–428.
M. Farber and R. E. Jamison: Convexity in graphs and hypergraphs. SIAM J. Algebraic Discrete Methods 7 (1986), 433–444.
S. Klavžar and H. M. Mulder: Median graphs: characterizations, location theory and related structures. J. Combin. Math. Combin. Comput. 30 (1999), 103–127.
H. M. Mulder: The Interval Function of a Graph. Mathematical Centre Tracts 132, Mathematisch Centrum, Amsterdam, 1980.
H. M. Mulder: Transit functions on graphs. In preparation.
M. A. Morgana and H. M Mulder: The induced path convexity, betweenness, and svelte graphs. Discrete Math. To appear.
L. Nebeský: A characterization of the interval function of a connected graph. Czechoslovak Math. J. 44(119) (1994), 173–178.
L. Nebeský: Characterizing the interval function of a connected graph. Math. Bohem. 123(2) (1998), 137–144.
E. Sampathkumar: Convex sets in graphs. Indian J. Pure Appl. Math. 15 (1984), 1065–1071.
M. L. J. van de Vel: Theory of Convex Structures. North Holland, Amsterdam, 1993.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Changat, M., Klavzar, S. & Mulder, H.M. The All-Paths Transit Function of a Graph. Czechoslovak Mathematical Journal 51, 439–448 (2001). https://doi.org/10.1023/A:1013715518448
Issue Date:
DOI: https://doi.org/10.1023/A:1013715518448