English
Related papers

Related papers: Sub-semigroups determined by the zero-divisor grap…

200 papers

A regular bipartite graph $\Gamma$ is called semisymmetric if its full automorphism group $\mathrm{Aut}(\Gamma)$ acts transitively on the edge set but not on the vertex set. For a subgroup $G$ of $\mathrm{Aut}(\Gamma)$ that stabilizes the…

Group Theory · Mathematics 2024-12-05 Yunsong Gan , Weijun Liu , Binzhou Xia

In this paper, two outwardly different graphs, namely, the zero divisor graph $\Gamma(C_c(X))$ and the comaximal graph $\Gamma_2^{'}(C_c(X))$ of the ring $C_c(X)$ of all real-valued continuous functions having countable range, defined on…

General Topology · Mathematics 2022-06-14 Rakesh Bharati , Amrita Acharyya , A. Deb Ray , Sudip Kumar Acharyya

In the suborbital graphs studies, there has been a research gap in the sense that the Modular group is connected to two numbers. Thus, this paper attempts to contribute to the studies developed by Gauss, Bolyai, Lobachevsky and Riemann.…

General Mathematics · Mathematics 2025-12-09 Ibrahim Gokcan , Ali Hikmet Deger

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…

Combinatorics · Mathematics 2023-01-31 Praveen Mathil , Barkha Baloda , Jitender Kumar

We provide a summary of research on disjoint zero-sum subsets in finite Abelian groups, which is a branch of additive group theory and combinatorial number theory. An orthomorphism of a group $\Gamma$ is defined as a bijection $\varphi$…

Combinatorics · Mathematics 2024-10-30 Sylwia Cichacz

The Zero divisor Graph of a commutative ring $R$, denoted by $\Gamma[R]$, is a graph whose vertices are non-zero zero divisors of R and two vertices are adjacent if their product is zero. The compressed zero divisor graph $\Gamma_E[R]$ is…

Rings and Algebras · Mathematics 2020-01-07 B. Surendranath Reddy , Rupali S. Jain , N. Laxmikanth

This article studies the zero divisor graphs of the ring of Lipschitz integers modulo $n$. In particular we focus on the number of vertices, the diameter and the girth. We also give some results regarding the domination number of these…

Rings and Algebras · Mathematics 2015-05-04 Jose Maria Grau , Celino Miquel , Antonio Oller-Marcen

We provide a construction of the induced subgraphs of the zero-divisor graph of $M_2(R)$ for the ring $R$ of algebraic integers of some number fields that are neither complete nor connected, and study the structure of the induced subgraphs…

Combinatorics · Mathematics 2025-08-04 WonTae Hwang , Ei Thu Thu Kyaw

In this paper we introduce and study a new graph invariant derived from the degree sequence of a graph $G$, called the sub-$k$-domination number and denoted $sub_k(G)$. We show that $sub_k(G)$ is a computationally efficient sharp lower…

Discrete Mathematics · Computer Science 2016-11-09 David Amos , John Asplund , Boris Brimkov , Randy Davila

Our aim is to show the way we pass from the results of ordered semigroups (or semigroups) to ordered $\Gamma$-semigroups (or $\Gamma$-semigroups). The results of this note have been transferred from ordered semigroups. The concept of…

General Mathematics · Mathematics 2013-07-18 Niovi Kehayopulu

The subdivision graph $S(\Sigma)$ of a connected graph $\Sigma$ is constructed by adding a vertex in the middle of each edge. In a previous paper written with Cheryl E. Praeger, we characterised the graphs $\Sigma$ such that $S(\Sigma)$ is…

Combinatorics · Mathematics 2011-03-31 Ashraf Daneshkhah , Alice Devillers

A perfect code in a graph $\Gamma$ is a subset $C$ of $V(\Gamma)$ such that no two vertices in $C$ are adjacent and every vertex in $V(\Gamma)\setminus C$ is adjacent to exactly one vertex in $C$. Let $G$ be a finite group and $C$ a subset…

Combinatorics · Mathematics 2022-11-08 Junyang Zhang

A divisor graph $G$ is an ordered pair $(V, E)$ where $V \subset \mathbbm{Z}$ and for all $u \neq v \in V$, $u v \in E$ if and only if $u \mid v$ or $v \mid u$. A graph which is isomorphic to a divisor graph is also called a divisor graph.…

Combinatorics · Mathematics 2007-05-23 Le Anh Vinh

We consider a family of problems that are concerned about making predictions for the majority of unlabeled, graph-structured data samples based on a small proportion of labeled samples. Relational information among the data samples, often…

Machine Learning · Computer Science 2019-11-05 Jiaqi Ma , Weijing Tang , Ji Zhu , Qiaozhu Mei

The main purpose of this paper is to investigate the zero-divisors of semigroups with zero and semirings and in particular, to discuss eversible and reversible semigroups and semirings. We also introduce a new ring-like algebraic structure…

Rings and Algebras · Mathematics 2019-08-16 Peyman Nasehpour

Inverse graph semigroups were defined by Ash and Hall in 1975. They found necessary and sufficient conditions for the semigroups to be congruence free. In this paper we give a description of congruences on a graph inverse semigroup in terms…

Group Theory · Mathematics 2018-06-29 Zheng-Pan Wang

We describe the commuting graph of a Rees matrix semigroup over a group and investigate its properties: diameter, clique number, girth, chromatic number and knit degree. The maximum size of a commutative subsemigroup of a Rees matrix…

Group Theory · Mathematics 2024-12-10 Tânia Paulista

A numerical index is introduced for semigroups of completely positive maps of $\Cal B(H)$ which generalizes the index of E_0-semigroups. It is shown that the index of a unital completely positive semigroup agrees with the index of its…

funct-an · Mathematics 2008-02-03 William Arveson

We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…

Group Theory · Mathematics 2016-05-18 Michael Giudici , Bojan Kuzma

The undirected zero divisor graph of a commutative ring with unity \( R \), denoted by \( \Gamma(R) = (V(\Gamma(R)), E(\Gamma(R))) \). The vertex set \( V(\Gamma(R)) \) consists of all the non-zero zero-divisors of \( R \). The edge set \(…

Combinatorics · Mathematics 2026-03-23 Vidya S , Sunny Kumar Sharma , Prasanna Poojary , Vadiraja Bhatta G R