Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 15 of 15 for “"Divisor graph"”.
-
Divisor Graph and Factorization Type
… some natural ideal conditions and show how graphs can be defined that give a visualization of these conditions. We examine the interplay between the multiplicative ideal theory and the graph-theoretic structure of the associated graph. In this research, we associate a graph in a natural way …
-
The Congruence-Based Zero-Divisor Graph
… <em>R</em>. We define the congruence-based zero-divisor graph of R ito be the simple graph with vertices the nonzero zero-divisors of <em>R</em>/~ and with an edge between distinct vertices [<em>x</em>] and [<em>y</em>] if and only if [<em>x</em>][<em>y</em>] = [0]. Examples include the usual …
-
Generalizations and Variations of the Zero-Divisor Graph
… generalizations and variations of the zero-divisor graph on commutative rings with identity. A zero-divisor graph is a graph whose vertex set is the nonzero zero-divisors of a ring, wherein two distinct vertices are adjacent if their product is zero. Variations of the zero-divisor graph are …
-
Generalizations of the Zero-Divisor Graph of a Ring
… <em>Z</em>(<em>R</em>) denote the set of zerodivisors of R. We define an undirected graph Γ(<em>R</em>) with vertices <em>Z</em>(<em>R</em>)* = <em>Z</em>(<em>R</em>) - {0}, where distinct vertices <em>x</em> and <em>y</em> of R are connected if and only if <em>xy</em> = 0. This graph is …
-
Graph Theoretic Properties of the Zero-Divisor Graph of a Ring
… with 1 ≠ 0, and let Z(R) denote the set of zero-divisors of R. One can associate with R a graph Γ(R) whose vertices are the nonzero zero-divisors of R. Two distinct vertices x and y are joined by an edge if and only if xy = 0 in R. Γ® is often called the zero-divisor graph of R. We determine …
-
Various Topics on Graphical Structures Placed on Commutative Rings
<p>In this dissertation, we look at two types of graphs that can be placed on a commutative ring: the zero-divisor graph and the ideal-based zero-divisor graph. A zero-divisor graph is a graph whose vertices are the nonzero zero-divisors of a ring and two vertices are connected by an edge if and …
-
Properties of Ideal-Based Zero-Divisor Graphs of Commutative Rings
… this research is on a generalization of the zero-divisor graph called the ideal-based zero-divisor graph for commutative rings with nonzero identity. We consider such a graph to be nontrivial when it is nonempty and distinct from the zero-divisor graph of <em>R</em>. We begin by classifying all …
-
Planar Zero-Divisor Graphs
… nonzero commutative ring with identity is a graph whose vertices are the nonzero zero-divisors, and such that two distinct vertices x and y are adjacent if and only if xy = 0. this graph is called the zero-divisor graph of the ring. Now assume that the ring is not a field. A result of Akbari, …
-
Zero Divisor Graphs and Poset Decomposition
A graph is associated to any commutative ring R where the vertices are the non-zero zero divisors of R with two vertices adjacent if x · y = 0. The zero-divisor graph has also been studied for various algebraic stuctures such as semigroups and partially ordered sets. In this paper, we will discuss …
-
Zero-Divisor Graphs, Commutative Rings of Quotients, and Boolean Algebras
<p>The <em>zero-divisor graph</em> of a commutative ring is the graph whose vertices are the nonzero zero-divisors of the ring such that distinct vertices are adjacent if and only if their product is zero. We use this construction to study the interplay between ring-theoretic and graph-theoretic …
-
Characterizations Of Zero Divisor Graphs Determined By Equivalence Classes Of Zero Divisors
We study zero divisor graphs of commutative rings determined by equivalence classes of zero divisors, specifically for a Noetherian ring R. We study the classification of these graphs. Specifically, we add more criteria to the list of characterizations that disqualify a graph as the zero divisor …
-
Algebraic and Arithmetic Properties of Graph Spectra
… algebraic and arithmetic properties of graph spectra. In particular, we study the algebraic degree of a graph, that is the dimension of the splitting field of the characteristic polynomial of the associated adjacency matrix over the rationals, and examine the question whether there is a …
-
Structure in Zero-Divisor Graphs of Commutative Rings
<p>In this research, we associate a graph in a natural way with the zero-divisors of a commutative ring. We endeavor to characterize various attributes of the graph, including connectivity, diameter, and symmetry. In exploring symmetry in the graph, we examine the automorphism group of the graph, …
-
Complete Equitable Decompositions
A well-known result in spectral graph theory states that if a graph has an equitable partition then the eigenvalues of the associated divisor graph are a subset of the graph's eigenvalues. A natural question question is whether it is possible to recover the remaining eigenvalues of the graph. Here …
-
Colorings of Zero-Divisor Graphs of Commutative Rings
… conjecture that the chromatic number of a zero-divisor graph of a ring R is equal to the clique number of the ring R. We begin by calculating the chromatic number of the zero-divisor graphs for some finite rings and characterizing rings whose zero-divisor graphs have finite chromatic number, …