Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
INDECOMPOSABILITY GRAPHS OF RINGS
View through CrossRef
AbstractWe define a subgraph of the zero divisor graph of a ring, associated to the ring idempotents. We study its properties and prove that for large classes of rings the connectedness of the graph is equivalent to the indecomposability of the ring and in those cases we also calculate the graph’s diameter.
Cambridge University Press (CUP)
Title: INDECOMPOSABILITY GRAPHS OF RINGS
Description:
AbstractWe define a subgraph of the zero divisor graph of a ring, associated to the ring idempotents.
We study its properties and prove that for large classes of rings the connectedness of the graph is equivalent to the indecomposability of the ring and in those cases we also calculate the graph’s diameter.
Related Results
Dreipassen – en magisk genstand?
Dreipassen – en magisk genstand?
The trefoil – a magical object?In 1997, a trefoil was found in a cremation pit at Bilstrup near Skive in Viborg county. The other grave goods, comprising fragments of arm rings and...
A Kurosh-Amitsur Completely Prime Radical for Near-rings
A Kurosh-Amitsur Completely Prime Radical for Near-rings
Two generalizations of the completely prime radical of rings to near-rings, namely the completely prime radical of near-rings and the completely equiprime radical of near-rings wer...
Graphs Defined on Rings: A Review
Graphs Defined on Rings: A Review
The study on graphs emerging from different algebraic structures such as groups, rings, fields, vector spaces, etc. is a prominent area of research in mathematics, as algebra and g...
Twilight graphs
Twilight graphs
AbstractThis paper deals primarily with countable, simple, connected graphs and the following two conditions which are trivially satisfied if the graphs are finite:(a) there is an ...
Etruscan and South Italian Finger Rings in Oxford
Etruscan and South Italian Finger Rings in Oxford
Of the many benefactions to the University of Oxford made by Charles Drury Edmond Fortnum (1820–99) one of the most important but least publicised was his great collection of finge...
Graphs Defined on Rings: A Review
Graphs Defined on Rings: A Review
The study on graphs emerging from different algebraic structures like groups, rings, fields, vector spaces, etc. is a prominent area of research in mathematics, as algebra and grap...
On Tuza's conjecture in even co-chain graphs
On Tuza's conjecture in even co-chain graphs
In 1981, Tuza conjectured that the cardinality of a minimum set of edges that intersects every triangle of a graph is at most twice the cardinality of a maximum set of edge-disjoin...
Model-checking ecological state-transition graphs
Model-checking ecological state-transition graphs
AbstractModel-checking is a methodology developed in computer science to automatically assess the dynamics of discrete systems, by checking if a system modelled as a state-transiti...