Наукова електронна бібліотека
періодичних видань НАН України

Перегляд Algebra and Discrete Mathematics, 2018, Vol. 26, № 2 за назвою

Репозиторій DSpace/Manakin

Перегляд Algebra and Discrete Mathematics, 2018, Vol. 26, № 2 за назвою

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

  • Abelian doppelsemigroups 
    Zhuchok, A.V.; Knauer, K. (Algebra and Discrete Mathematics, 2018)
    A doppelsemigroup is an algebraic system consisting of a set with two binary associative operations satisfying certain identities. Doppelsemigroups are a generalization of semigroups and they have relationships with such ...
  • 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 ...
  • Connectedness of spheres in Cayley graphs 
    Brieussel, J.; Gournay, A. (Algebra and Discrete Mathematics, 2018)
    We introduce the notion of connection thickness of spheres in a Cayley graph, related to dead-ends and their retreat depth. It was well-known that connection thickness is bounded for finitely presented one-ended groups. ...
  • Endomorphisms of Cayley digraphs of rectangular groups 
    Arworn, S.; Gyurov, B.; Nupo, N.; Panma, S. (Algebra and Discrete Mathematics, 2018)
    Let Cay(S,A) denote the Cayley digraph of the semigroup S with respect to the set A, where A is any subset of S. The function f : Cay(S,A) → Cay(S,A) is called an endomorphism of Cay(S,A) if for each (x, y) ∈ E(Cay(S,A)) ...
  • Modules in which every surjective endomorphism has a δ-small kernel 
    Ebrahimi Atani, S.; Khoramdel, M.; Dolati Pishhesari, S. (Algebra and Discrete Mathematics, 2018)
    In this paper,we introduce the notion of δ-Hopfian modules. We give some properties of these modules and provide a characterization of semisimple rings in terms of δ-Hopfian modules by proving that a ring R is semisimple ...
  • On a graph isomorphic to its intersection graph: self-graphoidal graphs 
    Das, P.K.; Singh, K.R. (Algebra and Discrete Mathematics, 2018)
    A graph G is called a graphoidal graph if there exists a graph H and a graphoidal cover ψ of H such that G ≅ Ω (H, ψ ). Then the graph G is said to be self-graphoidal if it is isomorphic to one of its graphoidal graphs. ...
  • On unicyclic graphs of metric dimension 2 with vertices of degree 4 
    Dudenko, M.; Oliynyk, B. (Algebra and Discrete Mathematics, 2018)
    We show that if G is a unicyclic graph with metric dimension 2 and {a, b} is a metric basis of G then the degree of any vertex v of G is at most 4 and degrees of both a and b are at most 2. The constructions of unispider ...
  • Spectral properties of partial automorphisms of a binary rooted tree 
    Kochubinska, E. (Algebra and Discrete Mathematics, 2018)
    We study asymptotics of the spectral measure of a randomly chosen partial automorphism of a rooted tree. To every partial automorphism x we assign its action matrix Ax. It is shown that the uniform distribution on eigenvalues ...

Пошук


Розширений пошук

Перегляд

Мій обліковий запис