Related papers: Complete $r$-partite zero-divisor graphs and color…

Let $R$ be a commutative ring and $M$ be an $R$-module, and let $Z(M)$ be the set of all zero-divisors on $M$. In 2008, D.F. Anderson and A. Badawi introduced the regular graph of $R$. In this paper, we generalize the regular graph of $R$…

In this article, we discussed the zero-divisor graph of a commutative ring with identity $\mathbb{F}_p+u\mathbb{F}_p+u^2 \mathbb{F}_p$ where $u^3=0$ and $p$ is an odd prime. We find the clique number, chromatic number, vertex connectivity,…

Let $G$ be a finite group. We consider the set of the irreducible complex characters of $G$, namely $Irr(G)$, and the related degree set $cd(G)=\{\chi(1) : \chi\in Irr(G)\}$. Let $\rho(G)$ be the set of all primes which divide some…

A graph $G$ has a perfect division if its vertex set can be partitioned into two sets $A$, $B$ such that $G[A]$ is perfect and $\omega(G[B]) < \omega(G)$. We call $G$ perfectly divisible if every induced subgraph of $G$ admits a perfect…

The commuting graph of a group $G$ is the graph whose vertices are the elements of $G$, two distinct vertices joined if they commute. Our purpose in this paper is twofold: we discuss the computational problem of deciding whether a given…

We determine the automorphism group of the zero-divisor digraph of the semiring of matrices over an antinegative commutative semiring with a finite number of zero-divisors.

Transiso graph $\Gamma_d(G)$ is defined in for a finite group $G$ and a divisor $d$ of $|G|$. In the present paper, we have determined some finite groups $G$ for which the graphs $\Gamma_d(G)$ are complete for each divisor $d$ of $|G|$. We…

A graph $\Gamma$ is $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of arcs of $\Gamma$, where an arc is an ordered pair of adjacent vertices. Let $\Gamma$ be a $G$-symmetric graph such that its…

In this paper, we continue the program initiated by I. Beck's now classical paper concerning zero-divisor graphs of commutative rings. After the success of much research regarding zero-divisor graphs, many authors have turned their…

Given a graph $G$ with vertices $\{v_1,\ldots,v_n\}$, we define $\mathcal{S}(G)$ to be the set of symmetric matrices $A=[a_{i,j}]$ such that for $i\ne j$ we have $a_{i,j}\ne 0$ if and only if $v_iv_j\in E(G)$. Motivated by the Graph…

The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…

In this paper, we study non-zero component graph $\Gamma(\mathbb{V})$ on a finite dimensional vector space $\mathbb{V}$ over a finite field $\mathbb{F}$. We show that the graph is Hamiltonian and not Eulerian. We also characterize the…

Given a finite group $G$, the generating graph $\Gamma(G)$ of $G$ has as vertices the non-identity elements of $G$ and two vertices are adjacent if and only if they are distinct and generate $G$ as group elements. Let $G$ be a 2-generated…

A split graph is a graph whose vertex set can be partitioned into a clique and an independent set. A connected graph $G$ is said to be $t$-admissible if admits a special spanning tree in which the distance between any two adjacent vertices…

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…

Inspired by connections described in a recent paper by Mark L. Lewis, between the common divisor graph $\Ga(X)$ and the prime vertex graph $\Delta(X)$, for a set $X$ of positive integers, we define the bipartite divisor graph $B(X)$, and…

Let $G$ be a finite group, let $\pi(G)$ be the set of prime divisors of $|G|$ and let $\Gamma(G)$ be the prime graph of $G$. This graph has vertex set $\pi(G)$, and two vertices $r$ and $s$ are adjacent if and only if $G$ contains an…

Let $G$ be a finite group. The bipartite divisor graph for the set of irreducible complex character degrees is the undirected graph with vertex set consisting of the prime numbers dividing some character degree and of the non-identity…

If $G$ is the symmetry group of an uncolored pattern then a coloring of the pattern is semiperfect if the associated color group $H$ is a subgroup of $G$ of index 2. We give results on how to identify and enumerate all inequivalent…

Let R be a commutative ring with a non-zero identity. In this paper, we define a new graph, the compressed intersection annihilator graph, denoted by $IA(R)$, and investigate some of its theoretical properties and its relation with the…