Displaying similar documents to “A direct approach to co-universal algebras associated to directed graphs.”

Antichains in the homomorphism order of graphs

Dwight Duffus, Peter, L. Erdös, Jaroslav Nešetřil, Lajos Soukup (2007)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

Let 𝔾 and 𝔻 , respectively, denote the partially ordered sets of homomorphism classes of finite undirected and directed graphs, respectively, both ordered by the homomorphism relation. Order theoretic properties of both have been studied extensively, and have interesting connections to familiar graph properties and parameters. In particular, the notion of a duality is closely related to the idea of splitting a maximal antichain. We construct both splitting and non-splitting infinite maximal...

An iterative algorithm for computing the cycle mean of a Toeplitz matrix in special form

Peter Szabó (2013)

Kybernetika

Similarity:

The paper presents an iterative algorithm for computing the maximum cycle mean (or eigenvalue) of n × n triangular Toeplitz matrix in max-plus algebra. The problem is solved by an iterative algorithm which is applied to special cycles. These cycles of triangular Toeplitz matrices are characterized by sub-partitions of n - 1 .