Related papers: Generalized Irreducible Divisor Graphs

Let $R$ be a commutative ring with $1\not = 0$, $Z(R)$ be the set of all zero-divisors of $R$, and $n \geq 1$. This paper introduces the $n$-total graph of a commutative ring $R$. The $n$-total graph of a commutative ring $R$, denoted by…

Divisible design graphs were introduced in 2011 by Haemers, Kharaghani and Meulenberg. Further, divisible design graphs which can be obtained as Cayley graphs were recently studied by Kabanov and Shalaginov. In this paper we give new…

This article investigates the properties of order-divisor graphs associated with finite groups. An order-divisor graph of a finite group is an undirected graph in which the set of vertices includes all elements of the group, and two…

This is a first of our papers devoted to "noncommutative topology and graph theory". Its origin is the paper math.QA/0002238 by I. Gelfand, V. Retakh, and R.L. Wilson where a new class of noncommutative algebras $Q_n$ was introduced. The…

Let $R$ be a commutative ring with unity and $Z(R)$ and ${\rm Reg}(R)$ be the set of zero-divisors and non-zero zero-divisors of $R$, respectively. We denote by $T(\Gamma(R))$, the total graph of $R$, a simple graph with the vertex set $R$…

In this paper, we first characterize which generalized lexicographic products are divisor graphs. As applications, we show that power graphs, reduced power graphs and order graphs are all divisor graphs, which also implies the main result…

This paper discusses the extension of the Prototype Verification System (PVS) sub-theory for rings, part of the PVS algebra theory, with theorems related to the division algorithm for Euclidean rings and Unique Factorization Domains that…

This thesis concerns the study of homogeneous factorisations of complete graphs with edge-transitive factors. A factorisation of a complete graph $K_n$ is a partition of its edges into disjoint classes. Each class of edges in a…

We introduce a new graph invariant of finite groups that provides a complete characterization of the splitting types of unramified prime ideals in normal number field extensions entirely in terms of the Galois group. In particular, each…

This article investigates multiset dimensions in zero divisor graphs (ZD-graphs) associated with rings. Through rigorous analysis, we establish general bounds for the multiset dimension (Mdim) in ZD-graphs, exploring various commutative…

Let $R$ be a finite commutative ring with $1\ne 0$. In this article, we study the total graph of $R$, denoted by $\tau (R)$, determine some of its basic graph-theoretical properties, determine when it is Eulerian, and find some conditions…

We give a complete characterization of generic irreducibility for dispersion polynomials and Bloch varieties of periodic graph operators. More precisely, we prove that for a generic choice of edge weights and potentials, the dispersion…

As in algebraic geometry, an effective divisor class on a vertex-weighted graph is called special if also its residual class is effective. We study the question, when this is true already on the level of divisors; that is, when there exists…

A path system $\mathcal{P}$ in a graph $G=(V,E)$ is said to be irreducible if there does not exist a partition $V= A\sqcup B$ such that $\mathcal{P}$ restricts to a path system on both $G[A]$ and $G[B]$. In this paper, we construct an…

This is a survey of the method of graph cuts and its applications to graph clustering of weighted unsigned and signed graphs. I provide a fairly thorough treatment of the method of normalized graph cuts, a deeply original method due to Shi…

We introduce and study a new class of integral domains which we call irreducible divisor pair domains (IDPDs). In particular, we show how IDPDs fit in with other classes of integral domains defined in terms of factorization conditions. For…

In the early 1960's, Moreau and Rockafellar introduced a concept of called \emph{subgradient} for convex functions, initiating the developments of theoretical and applied convex analysis. The needs of going beyond convexity motivated the…

We extend the notion of the compressed zero-divisor graph $\varTheta(R)$ to noncommutative rings in a way that still induces a product preserving functor $\varTheta$ from the category of finite unital rings to the category of directed…

O'Donnell, Wright, Wu and Zhou [SODA 2014] introduced the notion of robustly asymmetric graphs. Roughly speaking, these are graphs in which for every $0 \le \rho \le 1$, every permutation that permutes a $\rho$ fraction of the vertices maps…

The divisor theory of the complete graph $K_n$ is in many ways similar to that of a plane curve of degree $n$. We compute the splitting types of all divisors on the complete graph $K_n$. We see that the possible splitting types of divisors…