The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

The search session has expired. Please query the service again.

Displaying similar documents to “n-ary transit functions in graphs”

New proof of a characterization of geodetic graphs

Ladislav Nebeský (2002)

Czechoslovak Mathematical Journal

Similarity:

In [3], the present author used a binary operation as a tool for characterizing geodetic graphs. In this paper a new proof of the main result of the paper cited above is presented. The new proof is shorter and simpler.

Generalized midconvexity

Jacek Tabor, Józef Tabor, Krzysztof Misztal (2013)

Banach Center Publications

Similarity:

There are many types of midconvexities, for example Jensen convexity, t-convexity, (s,t)-convexity. We provide a uniform framework for all the above mentioned midconvexities by considering a generalized middle-point map on an abstract space X. We show that we can define and study the basic convexity properties in this setting.

Compositions of ternary relations

Norelhouda Bakri, Lemnaouar Zedam, Bernard De Baets (2021)

Kybernetika

Similarity:

In this paper, we introduce six basic types of composition of ternary relations, four of which are associative. These compositions are based on two types of composition of a ternary relation with a binary relation recently introduced by Zedam et al. We study the properties of these compositions, in particular the link with the usual composition of binary relations through the use of the operations of projection and cylindrical extension.

A semantic construction of two-ary integers

Gabriele Ricci (2005)

Discussiones Mathematicae - General Algebra and Applications

Similarity:

To binary trees, two-ary integers are what usual integers are to natural numbers, seen as unary trees. We can represent two-ary integers as binary trees too, yet with leaves labelled by binary words and with a structural restriction. In a sense, they are simpler than the binary trees, they relativize. Hence, contrary to the extensions known from Arithmetic and Algebra, this integer extension does not make the starting objects more complex. We use a semantic construction to get this extension....