Transit functions on graphs (and posets)

The notion of transit function is introduced to present a unifying approach for results and ideas on intervals, convexities and betweenness in graphs and posets. Prime examples of such transit functions are the interval function I and the induced path function J of a connected graph. Another transit function is the all-paths function. New transit functions are introduced, such as the cutvertex transit function and the longest path function. The main idea of transit functions is that of ‘transferring’ problems and ideas of one transit function to the other. For instance, a result on the interval function I might suggest similar problems for the induced path function J. Examples are given of how fruitful this transfer can be. A list of Prototype Problems and Questions for this transferring process is given, which suggests many new questions and open problems.

[1]  M. Sholander.  Medians, lattices, and trees , 1954 .

[2]  Henry Martyn Mulder,et al.  Induced Path Transit Function, Betweenness and Monotonicity , 2003, Electron. Notes Discret. Math..

[3]  Hans-Jürgen Bandelt,et al.  Quasi-median graphs and algebras , 1994, J. Graph Theory.

[4]  Ladislav Nebeský,et al.  A characterization of the interval function of a connected graph , 1994 .

[5]  Fred S. Roberts,et al.  The Median Procedure on Median Graphs , 1998, Discret. Appl. Math..

[6]  Ladislav Nebeský.  Characterizing the interval function of a connected graph , 1998 .

[7]  M. Sholander.  Trees, lattices, order, and betweenness , 1952 .

[8]  Van de M. L. J. Vel.  Theory of convex structures , 1993 .

[9]  Gary Chartrand,et al.  Convex sets in graphs , 1999 .

[10]  Nellie Clarke Brown.  Trees , 1896, Savage Dreams.

[11]  Bernard Harris,et al.  Graph theory and its applications , 1970 .

[12]  H. M. Mulder.  The interval function of a graph , 1980 .

[13]  Pierre Duchet,et al.  Convex sets in graphs, II. Minimal path convexity , 1987, J. Comb. Theory B.

[14]  Henry Martyn Mulder,et al.  The induced path convexity, betweenness, and svelte graphs , 2002, Discret. Math..

[15]  Manoj Changat,et al.  On triangle path convexity in graphs , 1999, Discret. Math..

[16]  Alexander Schrijver,et al.  Median graphs and Helly hypergraphs , 1979, Discret. Math..

[17]  Ladislav Nebeský.  Algebraic properties of Husimi trees , 1982 .

[18]  Praha.  THE INTERVAL FUNCTION OF A CONNECTED GRAPH AND A CHARACTERIZATION OF GEODETIC GRAPHS , 2002 .

[19]  Martyn Mulder,et al.  The structure of median graphs , 1978, Discret. Math..

[20]  Ladislav Nebeský,et al.  The induced paths in a connected graph and a ternary relation determined by them , 2002 .

[21]  Gerard Sierksma,et al.  Convexities related to path properties on graphs , 2005, Discret. Math..

[22]  S. P. Avann.  Metric ternary distributive semi-lattices , 1961 .

[23]  Sandi Klavzar,et al.  The All-Paths Transit Function of a Graph , 2001 .

[24]  A. J. Goldman,et al.  Letter to the Editor---A Localization Theorem for Optimal Facility Placement , 1970 .

[25]  Manoj Changat,et al.  Induced path transit function, monotone and Peano axioms , 2004, Discret. Math..

[26]  Claude Tardif,et al.  Prefibers and the cartesian product of metric spaces , 1992, Discret. Math..