Related papers: Graphs of Commutatively Closed Sets
We present simple graph-theoretic characterizations of Cayley graphs for monoids, semigroups and groups. We extend these characterizations to commutative monoids, semilattices, and abelian groups.
This paper introduces a new approach to associating a graph with a commutative ring. Let $R$ be a commutative ring with identity. The unit-zero divisor graph of a commutative ring $R$, denoted by $G_{UZ}(R)$, offers a novel framework for…
We study relationships between certain algebraic properties of groups and rings definable in a first order structure or $*$-closed in a compact $G$-space. As a consequence, we obtain a few structural results about $\omega$-categorical rings…
Topics concerning metric dimension related invariants in graphs are nowadays intensively studied. This compendium of combinatorial and computational results on this topic is an attempt of surveying those contributions that are of the…
Many systems of interest in science and engineering are made up of interacting subsystems. These subsystems, in turn, could be made up of collections of smaller interacting subsystems and so on. In a series of papers David Spivak with…
Fix a prime number $p$. We report on some recent developments in algebraic geometry (broadly construed) over $p$-adically complete commutative rings. These developments include foundational advances within the subject as well as external…
The aim of this paper is to study commuting graphs of completely $0$-simple semigroups, using the characterization of these semigroups as $0$-Rees matrix semigroups over a groups. We establish a method to decide whether the commuting graph…
We investigate the algebraic structure on the set of closure operations of a ring. We show the set of closure operations is not a monoid under composition for a discrete valuation ring. Even the set of semiprime operations over a DVR is not…
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
The processes of constructing some graphs from others using binary operations of union with intersection (gluing) are studied. For graph classes closed with respect to gluing operations the elemental and operational bases are introduced.…
We introduce partial group algebras with relations in a purely algebraic framework. Given a group and a set of relations, we define an algebraic partial action and prove that the resulting partial skew group ring is isomorphic to the…
This note provides an introduction to selected topics in algebraic graph theory, including strongly regular graphs, Steiner systems, and automorphism groups. We describe constructions and properties of notable graphs such as the Petersen…
We apply model theoretic methods to the problem of existence of countable universal graphs with finitely many forbidden connected subgraphs. We show that to a large extent the question reduces to one of local finiteness of an…
We study the number of connected graphs with $n$ vertices that cannot be written as the cartesian product of two graphs with fewer vertices. We give an upper bound which implies that for large $n$ almost all graphs are both connected and…
The ring of graph invariants is spanned by the basic graph invariants which calculate the number of subgraphs isomorphic to a given graph in other graphs. These subgraphs counting invariants are not algebraically independent. In our view…
The combination of the group ring setting with the methods of character theory allows an elegant and powerful analysis of various combinatorial structures, via their character sums. These combinatorial structures include difference sets,…
Starting from context-free inverse graphs, we introduce a new class of groups and study their structural properties. We establish closure properties, show that their co-word problems are context-free, analyze torsion elements, and realize…
We organize a table of regular graphs with minimal diameters and minimal mean path lengths, large bisection widths and high degrees of symmetries, obtained by enumerations on supercomputers. These optimal graphs, many of which are newly…
The aim of this paper is to analize the structure of BL-algebras using commutative rings. From computational considerations, we are very interested in the finite case. We present new ways to generate finite BL-algebras using commutative…
Let $G = (V,E)$ be a simple graph. We investigate the Cohen-Macaulayness and algebraic invariants, such as the Castelnuovo-Mumford regularity and the projective dimension, of the toric ring $k[G]$ via those of toric rings associated to…