scholarly journals Annihilator graph of semiring of matrices over Boolean semiring

2020 ◽  
Vol 1494 ◽  
pp. 012009
Author(s):  
R Yudatama ◽  
V Y Kurniawan ◽  
S B Wiyono
2021 ◽  
Author(s):  
Haniiam Mariiaa ◽  
Vika Yugi Kurniawan ◽  
Sutrima

2014 ◽  
Vol 10 (5) ◽  
pp. 61-68
Author(s):  
Priyanka Pratim Baruah ◽  
◽  
Kuntala Patra

2015 ◽  
Vol 14 (10) ◽  
pp. 1250195 ◽  
Author(s):  
Song-Chol Han

Some properties of (left) k-ideals and r-ideals of a semiring are considered by the help of the congruence class semiring. It is proved that a proper k-ideal of a semiring with an identity is prime if it is a maximal left k-ideal. An equivalent condition for a proper r-ideal of a semiring being a maximal (left) r-ideal is established. It is shown that (left) r-ideals and (left) k-ideals coincide for an additively idempotent semiring, though the former is a special kind of the latter in general. It is proved that a proper k-ideal of an incline with an identity is a maximal k-ideal if and only if the corresponding congruence class semiring is the Boolean semiring.


2017 ◽  
Vol 54 (1) ◽  
pp. 331-342
Author(s):  
Mojgan Afkhami ◽  
Kazem Khashyarmanesh ◽  
Sepideh Salehifar

Author(s):  
S. Karthik ◽  
S. N. Meera ◽  
K. Selvakumar

Let [Formula: see text] be a commutative ring with identity and [Formula: see text] be the set of all nonzero zero-divisors of [Formula: see text]. The annihilator graph of commutative ring [Formula: see text] is the simple undirected graph [Formula: see text] with vertices [Formula: see text] and two distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if [Formula: see text]. The essential graph of [Formula: see text] is defined as the graph [Formula: see text] with the vertex set [Formula: see text] and two distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if [Formula: see text] is an essential ideal. In this paper, we classify all finite commutative rings with identity whose annihilator graph and essential graph have crosscap two.


2020 ◽  
Vol 49 (2) ◽  
pp. 325-332
Author(s):  
M. ADLIFARD ◽  
Sh. PAYROVI

1986 ◽  
Vol 6 (1) ◽  
pp. 81-97 ◽  
Author(s):  
Ki Hang Kim ◽  
Fred W. Roush

AbstractShift equivalence is the relation between A, B that there exists S, R, n > 0 with RA = BR, AS = SB, SR = An, RS = Bn. Strong shift equivalence is the equivalence relation generated by these equations with n = 1. We prove that for many Boolean matrices strong shift equivalence is characterized by shift equivalence and a trace condition. However, we also show that if A is strongly shift equivalent to B, then there exists a homomorphism from an iterated directed edge graph of A to the graph of B preserving the traces of powers. This yields results on colourings of iterated directed edge graphs and might distinguish new strong equivalence classes.


Sign in / Sign up

Export Citation Format

Share Document