نتایج جستجو برای: annihilator inclusion ideal graph
تعداد نتایج: 405779 فیلتر نتایج به سال:
Let R be a commutative ring with identity and Nil(R) be the set of nilpotent elements of R. The nil-graph of ideals of R is defined as the graph AG_N(R) whose vertex set is {I:(0)and there exists a non-trivial ideal such that and two distinct vertices and are adjacent if and only if . Here, we study conditions under which is complete or bipartite. Also, the independence number of is deter...
Let $R$ be a commutative ring with identity. Let $G(R)$ denote the maximal graph associated to $R$, i.e., $G(R)$ is a graph with vertices as the elements of $R$, where two distinct vertices $a$ and $b$ are adjacent if and only if there is a maximal ideal of $R$ containing both. Let $Gamma(R)$ denote the restriction of $G(R)$ to non-unit elements of $R$. In this paper we study the various graphi...
In this paper, we describe the primitive ideal space of the $C^*$-algebra $C^*(mathcal G)$ associated to the ultragraph $mathcal{G}$. We investigate the structure of the closed ideals of the quotient ultragraph $ C^* $-algebra $C^*left(mathcal G/(H,S)right)$ which contain no nonzero set projections and then we characterize all non gauge-invariant primitive ideals. Our results generalize the ...
The rings considered in this article are commutative with identity which admit at least two nonzero annihilating ideals. Let $R$ be a ring. Let $mathbb{A}(R)$ denote the set of all annihilating ideals of $R$ and let $mathbb{A}(R)^{*} = mathbb{A}(R)backslash {(0)}$. The annihilating-ideal graph of $R$, denoted by $mathbb{AG}(R)$ is an undirected simple graph whose vertex set is $mathbb{A}(R...
Let $M$ be a module over a commutative ring $R$ and let $N$ be a proper submodule of $M$. The total graph of $M$ over $R$ with respect to $N$, denoted by $T(Gamma_{N}(M))$, have been introduced and studied in [2]. In this paper, A generalization of the total graph $T(Gamma_{N}(M))$, denoted by $T(Gamma_{N,I}(M))$ is presented, where $I$ is an ideal of $R$. It is the graph with all elements of $...
We present a deterministic algorithm producing the number of k-colourings of a graph on n vertices in time 2nnO(1). We also show that the chromatic number can be found by a polynomial space algorithm running in time O(2.2461). Finally, we present a family of polynomial space approximation algorithms that find a number between χ(G) and (1 + )χ(G) in time O(1.2209 + 2.2461 − ).
Library research dengan pendekatan deduksi-induksi ini bertujuan untuk mengkaji kesemiprimaan mendasar aljabar tak bebas yang dibangun secara hingga atas ring komutatif unital. Tujuan praktis penelitian adalah mengaplikasikan suatu contoh semiprima non-komutatif pada protokol autentikasi berdasarkan masalah dekomposisi. Di samping itu, lebih umum dari semiprima, hal ditunjukkan penyangkal. Hasi...
In this paper we introduce the notion of generalized implication for lattices, as a binary function⇒ that maps every pair of elements of a lattice to an ideal. We prove that a bounded lattice A is distributive if and only if there exists a generalized implication ⇒ defined in A satisfying certain conditions, and we study the class of bounded distributive lattices A endowed with a generalized im...
We study the structure of generalized Verma modules over a semi-simple complex finite-dimensional Lie algebra, which are induced from simple modules over a parabolic subalgebra. We consider the case when the annihilator of the starting simple module is a minimal primitive ideal if we restrict this module to the Levi factor of the parabolic subalgebra. We show that these modules correspond to pr...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید