Related papers: Ideal-based quasi cozero divisor graph of a commut…

Suppose $X$ is a simple graph. The $X-$join $\Gamma$ of a set of complete or empty graphs $\{X_x \}_{x \in V(X)}$ is a simple graph with the following vertex and edge sets: \begin{eqnarray*} V(\Gamma) &=& \{(x,y) \ | \ x \in V(X) \ \& \ y…

For a finite group $G$ the co-prime graph $\Gamma(G)$ is defined as a graph with vertex set $G$ in which two distinct vertices $x$ and $y$ are adjacent if and only if $gcd(o(x),o(y))=1$ where $o(x)$ and $o(y)$ denote the orders of the…

Let $I$ be a homogeneous ideal in $R=\mathbb K[x_0,\ldots,x_n]$, such that $R/I$ is an Artinian Gorenstein ring. A famous theorem of Macaulay says that in this instance $I$ is the ideal of polynomial differential operators with constant…

Given a finite vector space $V=\mathbb{F}_q^n$, the $q$-analogue of a graph, called a $q$-graph, is a pair $\Gamma=(\mathcal{V},\mathcal{E})$, where $\mathcal{V}$ is the set of $1$-dimensional subspaces of $V$ and $\mathcal{E}$ is a subset…

Let $G$ be a finite simple graph on the vertex set $V(G) = \{x_{1}, \ldots, x_{n}\}$ and match$(G)$, min-match$(G)$ and ind-match$(G)$ the matching number, minimum matching number and induced matching number of $G$, respectively. Let…

Given a finite group $G$ with a normal subgroup $N$, the simple graph $\Gamma_\textit{G}( \textit{N} )$ is a graph whose vertices are of the form $|x^G|$, where $x\in{N\setminus{Z(G)}}$, and $x^G$ is the $G$-conjugacy class of $N$…

Let $\Gamma$ denote a finite, undirected, connected graph, with vertex set $X$. Fix a vertex $x \in X$. Associated with $x$ is a certain subalgebra $T=T(x)$ of ${\rm Mat}_X(\mathbb C)$, called the subconstituent algebra. The algebra $T$ is…

Let $G$ be a graph, a dominating induced matching (DIM) of $G$ is an induced matching that dominates every edge of $G$. In this paper we show that if a graph $G$ has a DIM, then $\chi(G) \leqslant 3$. Also, it is shown that if $G$ is a…

With a simple graph $G$ on $[n]$, we associate a binomial ideal $P_G$ generated by diagonal minors of an $n \times n$ matrix $X=(x_{ij})$ of variables. We show that for any graph $G$, $P_G$ is a prime complete intersection ideal and…

Two directed graphs are called covariance equivalent if they induce the same set of covariance matrices, up to a Lebesgue measure zero set, on the random variables of their associated linear structural equation models. For acyclic graphs,…

The essential annihilating-ideal graph $\mathcal{EG}(R)$ of a commutative unital ring $R$ is a simple graph whose vertices are non-zero ideals of $R$ with non-zero annihilator and there exists an edge between two distinct vertices $I,J$ if…

This article investigates multiset dimensions in zero divisor graphs (ZD-graphs) associated with rings. Through rigorous analysis, we establish general bounds for the multiset dimension (Mdim) in ZD-graphs, exploring various commutative…

For a nilpotent group $G$, let $\Xi(G)$ be the difference between the complement of the generating graph of $G$ and the commuting graph of $G$, with vertices corresponding to central elements of $G$ removed. That is, $\Xi(G)$ has vertex set…

In this paper, we introduce the comaximal graph $\Gamma(L)$ of a finite-dimensional Lie algebra $L$, whose vertices are the nontrivial proper Lie subalgebras of $L$ over a field $\mathbb{F}$, and two vertices $A$ and $B$ are adjacent if and…

Let $G$ be a simple graph on the vertex set $\{v_{1},\ldots,v_{n}\}$. An algebraic object attached to $G$ is the toric ideal $I_G$. We say that $I_G$ is subgraph splittable if there exist subgraphs $G_1$ and $G_2$ of $G$ such that…

We extend the notion of the compressed zero-divisor graph $\varTheta(R)$ to noncommutative rings in a way that still induces a product preserving functor $\varTheta$ from the category of finite unital rings to the category of directed…

Let $G$ be a finite group. For a fixed element $g$ in $G$ and a given subgroup $H$ of $G$, the relative $g$-noncommuting graph of $G$ is a simple undirected graph whose vertex set is $G$ and two vertices $x$ and $y$ are adjacent if $x \in…

The problem of characterizing graphs with a prescribed number of main eigenvalues is a long-standing problem in spectral graph theory. Although some constructions are known, only a few produce infinite families of simple connected graphs…

A graph $\Gamma$ is called $G$-symmetric if it admits $G$ as a group of automorphisms acting transitively on the set of ordered pairs of adjacent vertices. We give a classification of $G$-symmetric graphs $\Gamma$ with $V(\Gamma)$ admitting…

Let $\Gamma$ denote a $Q$-polynomial distance-regular graph with vertex set $X$ and diameter $D$. Let $A$ denote the adjacency matrix of $\Gamma$. For a vertex $x\in X$ and for $0 \leq i \leq D$, let $E^*_i(x)$ denote the projection matrix…