相关论文: Simple Graphs and Commutative Zero-Divisor Semigro…

We study how many comparability subgraphs are needed to partition the edge set of a perfect graph. We show that many classes of perfect graphs can be partitioned into (at most) two comparability subgraphs and this holds for almost all…

The zero-divisor graph $\Gamma(R)$ of a ring $R$ is a graph with nonzero zero-divisors of $R$ as vertices and distinct vertices $x,y$ are adjacent if $xy=0$ or $yx=0$. We provide an equivalence relation on a ring $R$ and express $\Gamma(R)$…

Two graphs having the same spectrum are said to be cospectral. A pair of singularly cospectral graphs is formed by two graphs such that the absolute values of their nonzero eigenvalues coincide. Clearly, a pair of cospectral graphs is also…

Let $R$ be a commutative ring with $\Z(R)$ its set of zero-divisors. In this paper, we study the total graph of $R$, denoted by $\T(\Gamma(R))$. It is the (undirected) graph with all elements of $R$ as vertices, and for distinct $x, y\in…

In this paper, we continue our study of the zero-divisor graphs of lower dismantlable lattices that was started in [20]. The present paper mainly deals with an Isomorphism Problem for the zero-divisor graphs of lattices. In fact, we prove…

We determine all graphs whose matching polynomials have at most five distinct zeros. As a consequence, we find new families of graphs which are determined by their matching polynomial.

Given a finite group G, the bipartite divisor graph for its conjugacy class sizes is the bipartite graph with bipartition consisting of the set of conjugacy class sizes of G-Z (where Z denotes the centre of G) and the set of prime numbers…

We are concerned with split graphs and pseudo-split graphs whose complements are isomorphic to themselves. These special subclasses of self-complementary graphs are actually the core of self-complementary graphs. Indeed, we show that all…

The Gruenberg-Kegel graph $\Gamma(G)$ of a finite group $G$ is the graph whose vertex set is the set of prime divisors of $|G|$ and in which two distinct vertices $r$ and $s$ are adjacent if and only if there exists an element of order $rs$…

In this article, explicit formulas for finding the determining number and the metric dimension of the zero-divisor graph of Z_n and non-Boolean semisimple rings are given. In the case of Boolean rings, an upper bound of the determining…

Directed graphs have long been used to gain understanding of the structure of semigroups, and recently the structure of directed graph semigroups has been investigated resulting in a characterization theorem and an analog of Fruct's…

In this article, we study the zero-divisor graph of the commutative non-chain ring with identity $ \mathbb{F}_p + u\mathbb{F}_p + v\mathbb{F}_p + uv\mathbb{F}_p,$ where \(u^2 = 0\), \(v^2 = 0\), \(uv = vu\), and \(p\) is an odd prime. We…

We examine indivisibility for classes of graphs. We show that the class of hereditarily $\alpha$-sparse graphs is indivisible if and only if $\alpha > 2$. Additionally, we show that the following classes of graphs are indivisible: perfect…

In this paper, we classify all the finite groups $G$ such that the commuting graph $\Gamma_C(G)$, order-sum graph $\Gamma_{OS}(G)$ and non-inverse graph $\Gamma_{NI}(G)$ are minimally edge connected graphs. We also classify all the finite…

Let $G=(V,E)$ be a simple graph. A set $S\subseteq V$ is independent set of $G$, if no two vertices of $S$ are adjacent. The independence number $\alpha(G)$ is the size of a maximum independent set in the graph. %An independent set with…

An automorphism of a graph is called quasi-semiregular if it fixes a unique vertex of the graph and its remaining cycles have the same length. This kind of symmetry of graphs was first investigated by Kutnar, Malni\v{c}, Mart\'{i}nez and…

The divisor theory of graphs views a finite connected graph $G$ as a discrete version of a Riemann surface. Divisors on $G$ are formal integral combinations of the vertices of $G$, and linear equivalence of divisors is determined by the…

Let $G$ be a finite group. The co-prime order graph of $G$ is the graph whose vertex set is $G$, and two distinct vertices $x,y$ are adjacent if gcd$(o(x),o(y))$ is either $1$ or a prime, where $o(x)$ and $o(y)$ are the orders of $x$ and…

The general ideal of this paper is to answer the following question: given a numerical property of commuting graphs, a class of semigroups $\mathcal{C}$ and $n\in\mathbb{N}$, is it possible to find a semigroup in $\mathcal{C}$ such that the…

The study of graph C*-algebras has a long history in operator algebras. Surprisingly, their quantum symmetries have never been computed so far. We close this gap by proving that the quantum automorphism group of a finite, directed graph…