<?xml version="1.0"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:dc="http://purl.org/dc/elements/1.1/"><rdf:Description rdf:about="https://dk.um.si/IzpisGradiva.php?id=65347"><dc:title>n-ary transit functions in graphs</dc:title><dc:creator>Changat,	Manoj	(Avtor)
	</dc:creator><dc:creator>Mathews,	Joseph	(Avtor)
	</dc:creator><dc:creator>Peterin,	Iztok	(Avtor)
	</dc:creator><dc:creator>Narasimha-Shenoi,	Prasanth G.	(Avtor)
	</dc:creator><dc:subject>mathematics</dc:subject><dc:subject>graph theory</dc:subject><dc:subject>n-arity</dc:subject><dc:subject>transit function</dc:subject><dc:subject>betweenness</dc:subject><dc:subject>Steiner convexity</dc:subject><dc:description>▫$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 geodesicaly convexity. Furthermore, we generalize the betweenness axioms to ▫$n$▫-ary transit functions and discuss the connectivity conditions for underlying hypergraph. Also ▫$n$▫-ary all paths transit function is considered.</dc:description><dc:date>2010</dc:date><dc:date>2017-03-31 13:59:44</dc:date><dc:type>Neznano</dc:type><dc:identifier>65347</dc:identifier><dc:language>sl</dc:language></rdf:Description></rdf:RDF>
