Digital Repository of Luhansk Taras Shevchenko National University

Browsing Algebra and Discrete Mathematics. - № 2 (24). - 2017 by Title

Browsing Algebra and Discrete Mathematics. - № 2 (24). - 2017 by Title

Sort by: Order: Results:

  • Zargeh, C. (ДЗ "ЛНУ імені Тараса Шевченка", 2017)
    In this note we investigate the structure of contact Lie algebras when the ground field is of characteristic 2. In order to describe the simple constituent of contact Lie algebras, by using computer algebra system, GAP, ...
  • Movsisyan, Yu. (ДЗ "ЛНУ імені Тараса Шевченка", 2017)
    Dickson characterized groups in terms of one-sided invertibility. In this note, we give comparable characterizations for Bol and Moufang loops.
  • Doostabadi, A.; Farrokhi, D.G. (ДЗ "ЛНУ імені Тараса Шевченка", 2017)
    The (proper) power graph of a group is a graph whose vertex set is the set of all (nontrivial) elements of the group and two distinct vertices are adjacent if one is a power of the other. Various kinds of planarity of ...
  • Kurdachenko, L. A; Subbotin, I. Ya.; Yashchuk, V. S. (ДЗ "ЛНУ імені Тараса Шевченка", 2017)
    In this paper, we introduce some algebraic structure associated with rings and lattices. It appeared as the result of our new approach to the fuzzy rings and L-fuzzy rings where L is a lattice. This approach allows us to ...
  • Kozerenko, S. (ДЗ "ЛНУ імені Тараса Шевченка", 2017)
    Given a pair (X, σ) consisting of a finite tree X and its vertex self-map σ one can construct the corresponding Markov graph Γ(X, σ) which is a digraph that encodes σ-covering relation between edges in X. M-graphs are ...
  • Pypka, A.A. (ДЗ "ЛНУ імені Тараса Шевченка", 2017)
    In this paper we obtain the description of locally finite groups whose cyclic subgroups are GNA-subgroups.
  • Oboudi, M.R. (ДЗ "ЛНУ імені Тараса Шевченка", 2017)
    Let G be a graph with the eigenvalues λ1(G) >· · · > λn(G). The largest eigenvalue of G, λ1(G), is called the spectral radius of G. Let β(G) = ∆(G) − λ1(G), where ∆(G) is the maximum degree of vertices of G. It is known ...
  • Chelvam, T. T.; Selvakumar, K. (2017)
    Let R be a commutative ring and Z(R) ∗ be its set of non-zero zero-divisors. The annihilator graph of a commu- tative ring R is the simple undirected graph AG(R) with vertices Z(R) ∗ , and two distinct vertices ...
  • Chandra, S.; Prakash, O.; Suthar, S. (ДЗ "ЛНУ імені Тараса Шевченка", 2018)
    Let Zn be the finite commutative ring of residue classes modulo n with identity and Γ(Zn) be its zero-divisor graph. In this paper, we investigate some properties of nilradical graph, denoted by N(Zn) and non-nilradical ...
  • Darani, A.Y.; Rahmatinia, M. (ДЗ "ЛНУ імені Тараса Шевченка", 2017)
    The purpose of this paper is to introduce some new classes of modules which is closely related to the classes of sharp modules, pseudo-Dedekind modules and T V -modules. In this paper we introduce the concepts of ...
  • Kala, R.; Mallika, A.; Selvakumar, K. (2017)
    For a commutative ring R and an ideal I of R, the ideal-based zero-divisor graph is the undirected graph ΓI (R) with vertices {x ∈ R−I : xy ∈ I for some y ∈ R−I}, where distinct vertices x and y are adjacent if and only ...
  • S. V. S. R., Raju (2017)
    A subset D of the vertex set of a connected graph G is called a total global neighbourhood dominating set(tgnd-set) of G if and only if D is a total dominating set of G as well as GN , where GN is the neighbourhood graph ...
  • Farsad, F.; Madanshekaf, A. (ДЗ "Луганський національний університет імені Тараса Шевченка", 2017)
    Let S be a pomonoid. In this paper, Pos-S, the category of S-posets and S-poset maps, is considered. One of the main aims of this paper is to draw attention to the notion of weak factorization systems in Pos-S. We show ...

Search DSpace


Advanced Search

Browse

My Account