Changat, Manoj; Mathews, Joseph; Peterin, Iztok; Narasimha-Shenoi, Prasanth G. \(n\)-ary transit functions in graphs. (English) Zbl 1217.05081 Discuss. Math., Graph Theory 30, No. 4, 671-685 (2010). Summary: \(n\)-ary transit functions are introduced as a generalization of binary (2-ary) transit functions. We show that they can be associated with convexities in natural way and discuss the Steiner convexity as a natural \(n\)-ary generalization of geodesical convexity. Furthermore, we generalize the betweenness axioms to \(n\)-ary transit functions and discuss the connectivity conditions for the underlying hypergraph. Also, an \(n\)-ary transit function for all paths is considered. Cited in 4 Documents MSC: 05C12 Distance in graphs 52A01 Axiomatic and generalized convexity Keywords:\(n\)-arity; transit function; betweenness; Steiner convexity PDF BibTeX XML Cite \textit{M. Changat} et al., Discuss. Math., Graph Theory 30, No. 4, 671--685 (2010; Zbl 1217.05081) Full Text: DOI