Displaying similar documents to “Some results on the annihilator graph of a commutative ring”

Classification of rings with toroidal Jacobson graph

Krishnan Selvakumar, Manoharan Subajini (2016)

Czechoslovak Mathematical Journal

Similarity:

Let R be a commutative ring with nonzero identity and J ( R ) the Jacobson radical of R . The Jacobson graph of R , denoted by 𝔍 R , is defined as the graph with vertex set R J ( R ) such that two distinct vertices x and y are adjacent if and only if 1 - x y is not a unit of R . The genus of a simple graph G is the smallest nonnegative integer n such that G can be embedded into an orientable surface S n . In this paper, we investigate the genus number of the compact Riemann surface in which 𝔍 R can be embedded and...

Some classes of perfect strongly annihilating-ideal graphs associated with commutative rings

Mitra Jalali, Abolfazl Tehranian, Reza Nikandish, Hamid Rasouli (2020)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

Let R be a commutative ring with identity and A ( R ) be the set of ideals with nonzero annihilator. The strongly annihilating-ideal graph of R is defined as the graph SAG ( R ) with the vertex set A ( R ) * = A ( R ) { 0 } and two distinct vertices I and J are adjacent if and only if I Ann ( J ) ( 0 ) and J Ann ( I ) ( 0 ) . In this paper, the perfectness of SAG ( R ) for some classes of rings R is investigated.

The prime ideals intersection graph of a ring

M. J. Nikmehr, B. Soleymanzadeh (2017)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

Let R be a commutative ring with unity and U ( R ) be the set of unit elements of R . In this paper, we introduce and investigate some properties of a new kind of graph on the ring R , namely, the prime ideals intersection graph of R , denoted by G p ( R ) . The G p ( R ) is a graph with vertex set R * - U ( R ) and two distinct vertices a and b are adjacent if and only if there exists a prime ideal 𝔭 of R such that a , b 𝔭 . We obtain necessary and sufficient conditions on R such that G p ( R ) is disconnected. We find the diameter and...

Some results on the co-intersection graph of submodules of a module

Lotf Ali Mahdavi, Yahya Talebi (2018)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

Let R be a ring with identity and M be a unitary left R -module. The co-intersection graph of proper submodules of M , denoted by Ω ( M ) , is an undirected simple graph whose vertex set V ( Ω ) is a set of all nontrivial submodules of M and two distinct vertices N and K are adjacent if and only if N + K M . We study the connectivity, the core and the clique number of Ω ( M ) . Also, we provide some conditions on the module M , under which the clique number of Ω ( M ) is infinite and Ω ( M ) is a planar graph. Moreover, we give...

(Generalized) filter properties of the amalgamated algebra

Yusof Azimi (2022)

Archivum Mathematicum

Similarity:

Let R and S be commutative rings with unity, f : R S a ring homomorphism and J an ideal of S . Then the subring R f J : = { ( a , f ( a ) + j ) a R and j J } of R × S is called the amalgamation of R with S along J with respect to f . In this paper, we determine when R f J is a (generalized) filter ring.

Degree sums of adjacent vertices for traceability of claw-free graphs

Tao Tian, Liming Xiong, Zhi-Hong Chen, Shipeng Wang (2022)

Czechoslovak Mathematical Journal

Similarity:

The line graph of a graph G , denoted by L ( G ) , has E ( G ) as its vertex set, where two vertices in L ( G ) are adjacent if and only if the corresponding edges in G have a vertex in common. For a graph H , define σ ¯ 2 ( H ) = min { d ( u ) + d ( v ) : u v E ( H ) } . Let H be a 2-connected claw-free simple graph of order n with δ ( H ) 3 . We show that, if σ ¯ 2 ( H ) 1 7 ( 2 n - 5 ) and n is sufficiently large, then either H is traceable or the Ryjáček’s closure cl ( H ) = L ( G ) , where G is an essentially 2 -edge-connected triangle-free graph that can be contracted to one of the two graphs of order 10...

Saturation numbers for linear forests P 6 + t P 2

Jingru Yan (2023)

Czechoslovak Mathematical Journal

Similarity:

A graph G is H -saturated if it contains no H as a subgraph, but does contain H after the addition of any edge in the complement of G . The saturation number, sat ( n , H ) , is the minimum number of edges of a graph in the set of all H -saturated graphs of order n . We determine the saturation number sat ( n , P 6 + t P 2 ) for n 10 3 t + 10 and characterize the extremal graphs for n > 10 3 t + 20 .

P-injective group rings

Liang Shen (2020)

Czechoslovak Mathematical Journal

Similarity:

A ring R is called right P-injective if every homomorphism from a principal right ideal of R to R R can be extended to a homomorphism from R R to R R . Let R be a ring and G a group. Based on a result of Nicholson and Yousif, we prove that the group ring RG is right P-injective if and only if (a) R is right P-injective; (b) G is locally finite; and (c) for any finite subgroup H of G and any principal right ideal I of RH , if f Hom R ( I R , R R ) , then there exists g Hom R ( RH R , R R ) such that g | I = f . Similarly, we also obtain equivalent...

Semicommutativity of the rings relative to prime radical

Handan Kose, Burcu Ungor (2015)

Commentationes Mathematicae Universitatis Carolinae

Similarity:

In this paper, we introduce a new kind of rings that behave like semicommutative rings, but satisfy yet more known results. This kind of rings is called P -semicommutative. We prove that a ring R is P -semicommutative if and only if R [ x ] is P -semicommutative if and only if R [ x , x - 1 ] is P -semicommutative. Also, if R [ [ x ] ] is P -semicommutative, then R is P -semicommutative. The converse holds provided that P ( R ) is nilpotent and R is power serieswise Armendariz. For each positive integer n , R is P -semicommutative...

Strongly 2-nil-clean rings with involutions

Huanyin Chen, Marjan Sheibani Abdolyousefi (2019)

Czechoslovak Mathematical Journal

Similarity:

A * -ring R is strongly 2-nil- * -clean if every element in R is the sum of two projections and a nilpotent that commute. Fundamental properties of such * -rings are obtained. We prove that a * -ring R is strongly 2-nil- * -clean if and only if for all a R , a 2 R is strongly nil- * -clean, if and only if for any a R there exists a * -tripotent e R such that a - e R is nilpotent and e a = a e , if and only if R is a strongly * -clean SN ring, if and only if R is abelian, J ( R ) is nil and R / J ( R ) is * -tripotent. Furthermore, we explore...

The operation and * operation of Cohen-Macaulay bipartite graphs

Yulong Yang, Guangjun Zhu, Yijun Cui, Shiya Duan (2024)

Czechoslovak Mathematical Journal

Similarity:

Let G be a finite simple graph with the vertex set V and let I G be its edge ideal in the polynomial ring S = 𝕂 [ V ] . We compute the depth and the Castelnuovo-Mumford regularity of S / I G when G = G 1 G 2 or G = G 1 * G 2 is a graph obtained from Cohen-Macaulay bipartite graphs G 1 , G 2 by the operation or * operation, respectively.

Matchings in complete bipartite graphs and the r -Lah numbers

Gábor Nyul, Gabriella Rácz (2021)

Czechoslovak Mathematical Journal

Similarity:

We give a graph theoretic interpretation of r -Lah numbers, namely, we show that the r -Lah number n k r counting the number of r -partitions of an ( n + r ) -element set into k + r ordered blocks is just equal to the number of matchings consisting of n - k edges in the complete bipartite graph with partite sets of cardinality n and n + 2 r - 1 ( 0 k n , r 1 ). We present five independent proofs including a direct, bijective one. Finally, we close our work with a similar result for r -Stirling numbers of the second kind. ...

Even factor of bridgeless graphs containing two specified edges

Nastaran Haghparast, Dariush Kiani (2018)

Czechoslovak Mathematical Journal

Similarity:

An even factor of a graph is a spanning subgraph in which each vertex has a positive even degree. Let G be a bridgeless simple graph with minimum degree at least 3 . Jackson and Yoshimoto (2007) showed that G has an even factor containing two arbitrary prescribed edges. They also proved that G has an even factor in which each component has order at least four. Moreover, Xiong, Lu and Han (2009) showed that for each pair of edges e 1 and e 2 of G , there is an even factor containing e 1 and e 2 ...