Related papers: Weakly nil clean graphs of rings

A graph $G$ is weakly $\gamma$-closed if every induced subgraph of $G$ contains one vertex $v$ such that for each non-neighbor $u$ of $v$ it holds that $|N(u)\cap N(v)|<\gamma$. The weak closure $\gamma(G)$ of a graph, recently introduced…

The nilpotent graph of a group $G$ is the simple and undirected graph whose vertices are the elements of $G$ and two distinct vertices are adjacent if they generate a nilpotent subgroup of $G$. Here we discuss some topological properties of…

Let $G$ and $H$ be disjoint embeddings of complete graphs $K_m$ and $K_n$ in $\mathbb{R}^3$ such that some cycle in $G$ links a cycle in $H$ with non-zero linking number. We say that $G$ and $H$ are *weakly linked* if the absolute value of…

Absolute integral closures of general commutative unital rings are explored. All rings admit absolute integral closures, but in general they are not unique. Among the reduced rings with finitely many minimal prime ideals, finite products of…

We consider weighted tiling systems to represent functions from graphs to a commutative semiring such as the Natural semiring or the Tropical semiring. The system labels the nodes of a graph by its states, and checks if the neighbourhood of…

Interaction between clique number $\omega(G) $ and chromatic number $\chi(G) $ of a graph is a well studied topic in graph theory. Perfect Graph Theorems are probably the most important results in this direction. Graph $G$ is called…

Let $R$ be a finite product of integral domains and $D$ be a union of prime ideals (it is possible that $R$ is just an integral domain). Let $n \geq 1$ be a positive integer. This paper introduces the $n$-total graph of a $(R, D)$. The…

Although the ``scale-free'' literature is large and growing, it gives neither a precise definition of scale-free graphs nor rigorous proofs of many of their claimed properties. In fact, it is easily shown that the existing theory has many…

We describe the structure of connected graphs with the minimum and maximum average distance, radius, diameter, betweenness centrality, efficiency and resistance distance, given their order and size. We find tight bounds on these graph…

This article investigates structural, geometrical, and topological characterizations and properties of weakly modular graphs and of cell complexes derived from them. The unifying themes of our investigation are various `nonpositive…

Consider a graph $G$ drawn on a fixed surface, and assign to each vertex a list of colors of size at least two if $G$ is triangle-free and at least three otherwise. We prove that we can give each vertex a color from its list so that each…

We study free scalar field theory on a graph, which gives rise to a modified version of discrete Green's function on a graph studied in \cite{CY}. We show that this gives rise to a graph invariant, which is closely related to the 2-dim…

In this paper we initiate the study of the total zero-divisor graphs over commutative rings with unity. These graphs are constructed by both relations that arise from the zero-divisor graph and from the total graph of a ring. We…

We give an especially simple proof of a theorem in graph theory that forms the key part of the solution to a problem in commutative algebra, on how to characterize the integral closure of a polynomial ring generated by quadratic monomials.

We consider in-depth and characterize in certain aspects the class of so-called {\it strongly NUS-nil clean rings}, that are those rings whose non-units are {\it square nil-clean} in the sense that they are a sum of a nilpotent and a…

Boundary analysis is developed for a rich class of generally infinite weighted graphs with compact metric completions. These graph completions have totally disconnected boundaries. The classical notion of $\epsilon$-components and the…

Let $R$ be a ring with unity. The cozero-divisor graph of a ring $R$ is an undirected simple graph whose vertices are the set of all non-zero and non-unit elements of $R$ and two distinct vertices $x$ and $y$ are adjacent if and only if $x…

The purpose of this note is to relate certain ring-theoretic properties of rings in mixed and positive characteristics that are related to each other by a tilting operation used in perfectoid geometry. To this aim, we exploit the…

A strong edge colouring of a graph is an assignment of colours to the edges of the graph such that for every colour, the set of edges that are given that colour form an induced matching in the graph. The strong chromatic index of a graph…

A complete description of the linearized gravitational field on a flat background is given in terms of gauge-independent quasilocal quantities. This is an extension of the results from gr-qc/9801068. Asymptotic spherical quasilocal…