14 problems
Zero-divisor graph unimodality conjecture. The independence polynomial is unimodal. The paper presents this as a conjecture following compu…
Let be a finite chromatic ring, and let be its zero-divisor graph. Write for the clique number of and for its chro…
Let be a finite commutative local ring with identity, of cardinality , and suppose that is not a field. Let be the simple graph whose vertices are the nonze…
Let be a commutative ring with non-zero unity, and let be the graph whose vertices are the non-zero zero-divisors of , with distinct vertices adjacent exactly wh…
Bender et al.'s conjecture. If is uniquely complemented with clique number or greater and every vertex has a unique complement, then is isomorphic to…
Let be a finite commutative semigroup with zero, and let be its zero-divisor graph. The graph is complemented if every vertex has an orthogonal vertex , me…
Let be a finite commutative semigroup with zero, and let be its zero-divisor graph. A graph is complemented if every vertex is orthogonal to some vertex, where adjacent…
Compressed-graph invariance conjecture. Under these hypotheses,
Compressed-graph structure conjecture. An edge joins the vertices represented by and if and only if
GCD-representative conjecture. For every ,
Compressed-graph characterization conjecture. The zero-divisor graphs are isomorphic if and only if
Extension conjecture. The results obtained for quotient rings of unique factorization domains should extend to any quotient ring of a unique factorization domain.
Let be a commutative ring, and let denote its zero-divisor graph. For a graph containing a cycle, write for its girth. Anderson–Livingston con…
Behboodi–Rakeei conjecture. Every reduced ring with more than two minimal primes has annihilating ideal-graph of girth . The paper states that this conjecture is settled by prov…