Перегляд за автором "Knauer, U."

Сортувати за: Порядок: Результатів:

  • A formula for the number of weak endomorphisms on paths 
    Knauer, U.; Pipattanajinda, N. (Algebra and Discrete Mathematics, 2018)
    A weak endomorphisms of a graph is a mapping on the vertex set of the graph which preserves or contracts edges. In this paper we provide a formula to determine the cardinalities of weak endomorphism monoids of finite ...
  • Characterization of finite simple semigroup digraphs 
    Meksawang, J.; Panma, S.; Knauer, U. (Algebra and Discrete Mathematics, 2011)
    This paper characterizes directed graphs which are Cayley graphs of finite simple semigroups, i.e. of a subspecies of completely regular semigroups. Moreover we investigate the structure of Cayley graphs of finite simple ...
  • The Endomorphism Monoids of (n − 3)-regular Graphs of Order n 
    Gyurov, B.; Knauer, U.; Panma, S.; Pipattanajinda, N. (Algebra and Discrete Mathematics, 2016)
    This paper is motivated by the result of W. Li, he presents an infinite family of graphs - complements of cycles - which possess a regular monoid. We show that these regular monoids are completely regular. Furthermore, we ...
  • The endomorphisms monoids of graphs of order n with a minimum degree n − 3 
    Pipattanajinda, N.; Knauer, U.; Gyurov, B.; Panma, S. (Algebra and Discrete Mathematics, 2014)
    We characterize the endomorphism monoids, End(G), of the generalized graphs G of order n with a minimum degree n − 3. Criteria for regularity, orthodoxy and complete regularity of those monoids based on the structure of G ...