Independent sets of some graphs associated to commutative rings

Abstract

Let G=(V,E) be a simple graph. A set S⊂eq V is independent set of G, if no two vertices of S are adjacent. The independence number α(G) is the size of a maximum independent set in the graph. %An independent set with cardinality Let R be a commutative ring with nonzero identity and I an ideal of R. The zero-divisor graph of R, denoted by (R), is an undirected graph whose vertices are the nonzero zero-divisors of R and two distinct vertices x and y are adjacent if and only if xy = 0. Also the ideal-based zero-divisor graph of R, denoted by I(R), is the graph which vertices are the set x∈ R I | xy∈ I for some y∈ R I\ and two distinct vertices x and y are adjacent if and only if xy ∈ I. In this paper we study the independent sets and the independence number of (R) and I(R).

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…