Related papers: Zero-Divisor Graphs of Quotient Rings

Let $A$ be a finite commutative ring with unity $1 \neq 0.$ An ideal of $A$ is said to be essential if it has a non-zero intersection with every non-zero ideal of $A.$ The essential graph of $A$ is a simple undirected graph whose vertex set…

Let $R$ be a commutative ring with unity. The prime ideal sum graph of the ring $R$ is a simple undirected graph whose vertex set is the set of nonzero proper ideals of $R$ and two distinct vertices $I$ and $J$ are adjacent if and only if…

The {\em distinguishing number} of a group $G$ acting faithfully on a set $V$ is the least number of colors needed to color the elements of $V$ so that no non-identity element of the group preserves the coloring. The {\em distinguishing…

We determine the automorphism group of the zero-divisor digraph of the semiring of matrices over an antinegative commutative semiring with a finite number of zero-divisors.

Let $S$ be an inverse semigroup with zero and let $Z(S)^\times$ be its set of non-zero divisors with respect to the natural partial order $\le $ on $S$, that is, $a \in Z(S)^\times $ if there exists $b\in S\setminus\{0\}$ with $\omega(a, b)…

A graph is almost bipartite if it contains exactly one odd cycle, and it is Konig-Egervary if the sum of the independence number and the matching number equals the order of the graph. We introduce the class of Bipartite-Almost Bipartite…

The dominating graph of a graph G is a graph whose vertices correspond to the dominating sets of G and two vertices are adjacent whenever their corresponding dominating sets differ in exactly one vertex. Studying properties of dominating…

A finite graph $\Gamma$ is called $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. We study a family of symmetric graphs, called the unitary…

For a graph G and integer r\geq 1 we denote the collection of independent r-sets of G by I^{(r)}(G). If v\in V(G) then I_v^{(r)}(G) is the collection of all independent r-sets containing v. A graph G, is said to be r-EKR, for r\geq 1, iff…

Perfect graphs form one of the distinguished classes of finite simple graphs. In 2006, Chudnovsky, Robertson, Seymour and Thomas proved that a graph is perfect if and only if it has no odd holes and no odd antiholes as induced subgraphs,…

Kaplanski's Zero Divisor Conjecture envisions that for a torsion-free group G and an integral domain R, the group ring R[G] does not contain non-trivial zero divisors. We define the length of an element a in R[G] as the minimal non-negative…

Several researchers have recently explored various graph parameters that can or cannot be characterized by the spectrum of a matrix associated with a graph. In this paper we show that several NP-hard zero forcing numbers are not…

In this paper, we study the zero-divisor graphs of a subclass of dismantlable lattices. These graphs are characterized in terms of the non-ancestor graphs of rooted trees.

Whenever graphs admit equitable partitions, their quotient graphs highlight the structure evidenced by the partition. It is therefore very natural to ask what can be said about two graphs that have the same quotient according to certain…

Much work has been done on generalized factorization techniques in integral domains, namely $\tau$-factorization. There has also been substantial progress made in investigating factorization in commutative rings with zero-divisors. There…

We determine the metric dimension of the zero-divisor graph of the matrix semiring over a commutative entire antinegative semiring.

The zero forcing number of a simple graph, written $Z(G)$, is a NP-hard graph invariant which is the result of the zero forcing color change rule. This graph invariant has been heavily studied by linear algebraists, physicists, and graph…

A commutative ring is reduced when it can be embedded into a direct product of fields. While the category of reduced commutative rings plays a fundamental role in affine geometry, it exhibits several structural deficiencies: it admits…

In this paper, we introduce a family of graphs which is a generalization of zero-divisor graphs and compute an upper-bound for the diameter of such graphs. We also investigate their cycles and cores.

Graphs are a fundamental abstraction in computer science and discrete mathematics, where information is encoded in their combinatorial structure. Graph-reduction techniques aim at simplifying graphs while preserving selected structural…