Related papers: Zero-divisor graphs of nilpotent-free semigroups
Let $G$ be $2$-generated group. The generating graph of $\Gamma(G)$ is the graph whose vertices are the elements of $G$ and where two vertices $g$ and $h$ are adjacent if $G=\langle g,h\rangle$. This graph encodes the combinatorial…
We consider an inverse problem for Schr\"odinger operators on connected equilateral graphs with standard matching conditions. We calculate the spectral determinant and prove that the asymptotic distribution of a subset of its zeros can be…
In this paper we continue our study of annihilating-ideal graph of commutative rings, that was introduced in Part I (see [5]). Let $R$ be a commutative ring with ${\Bbb{A}}(R)$ its set of ideals with nonzero annihilator and $Z(R)$ its set…
We associate a sequence of positive integers, termed the type sequence, with a cochordal graph. Using this type sequence, we compute all graded Betti numbers of its edge ideal. We then classify all positive integer $n$ such that the zero…
We survey research relating algebraic properties of powers of squarefree monomial ideals to combinatorial structures. In particular, we describe how to detect important properties of (hyper)graphs by solving ideal membership problems and…
For any graph inverse semigroup $G(E)$ we describe subsemigroups $D^0=D\cup\{0\}$ and $J^0=J\cup\{0\}$ of $G(E)$ where $D$ and $J$ are arbitrary $\mathcal{D}$-class and $\mathcal{J}$-class of $G(E)$, respectively. In particular, we prove…
The zero divisor graph of a commutative ring $R$ with unity is a graph whose vertices are the nonzero zero-divisors of the ring, with two distinct vertices being adjacent if their product is zero. This graph is denoted by $\Gamma(R)$. In…
We study the connectivity of proper power graphs of some family of finite groups including nilpotent groups, groups with a non-trivial partition, and symmetric and alternating groups.
A famous conjecture about group algebras of torsion-free groups states that there is no zero divisor in such group algebras. A recent approach to settle the conjecture is to show the non-existence of zero divisors with respect to the length…
The aim of this paper is to study the topological properties of algebraic sets with zero divisors. We impose a subbasic topology on the set of proper ideals of a $k$-algebra and this new ``$k$-space'' becomes a generalization of the…
The divisorial gonality of a graph is the minimum degree of a positive rank divisor on that graph. We introduce the multiplicity-free gonality of a graph, which restricts our consideration to divisors that place at most \(1\) chip on each…
Let $G$ be a simple graph and $I(G)$ be its edge ideal. In this article, we study the Castelnuovo-Mumford regularity of symbolic powers of edge ideals of join of graphs. As a consequence, we prove Minh's conjecture for wheel graphs,…
In this article we prove several important results on graded rings, especially monoid-rings, that are motivated and inspired by Kaplansky's zero-divisor, unit and idempotents conjectures. Among the main results, we first generalize…
One deals with arbitrary reduced free divisors in a polynomial ring over a field of characteristic zero, by stressing the ideal theoretic and homological behavior of the corresponding singular locus. A particular emphasis is given to both…
We leverage an algorithm of Deming [R.W. Deming, Independence numbers of graphs -- an extension of the Koenig-Egervary theorem, Discrete Math., 27(1979), no. 1, 23--33; MR534950] to decompose a matchable graph into subgraphs with a precise…
Ara\'ujo, Kinyon and Konieczny (2011) pose several problems concerning the construction of arbitrary commuting graphs of semigroups. We observe that every star-free graph is the commuting graph of some semigroup. Consequently, we suggest…
Schreier graphs, which possess both a graph structure and a Schreier structure (an edge-labeling by the generators of a group), are objects of fundamental importance in group theory and geometry. We study the Schreier structures with which…
Let $p$ and $q$ be distinct primes. The \textit{semiprime divisor function graph} denoted by $G_{D(pq)}$, is the graph with vertex set $V(G_{D(pq)})=\{1,p,q,pq\}$ and edge set $E(G_{D(pq)})=\{\{1,p\}, \{1,q\},\{1,pq\},\{p,pq\},\{q,pq\}\}$.…
Let $R$ be a commutative ring with unity not equal to zero and let $\Gamma(R)$ be a zero-divisor graph realized by $R$. For a simple, undirected, connected graph $G = (V, E)$, a {\it total perfect code} denoted by $C(G)$ in $G$ is a subset…
We introduce a homotopy theory of digraphs (directed graphs) and prove its basic properties, including the relations to the homology theory of digraphs constructed by the authors in previous papers. In particular, we prove the homotopy…