Related papers: On the intersection ideal graph of semigroups
The commuting graph of a finite non-commutative semigroup $S$, denoted $\cg(S)$, is a simple graph whose vertices are the non-central elements of $S$ and two distinct vertices $x,y$ are adjacent if $xy=yx$. Let $\mi(X)$ be the symmetric…
Let $G$ be a finite group and $N$ a normal subgroup of $G$. We determine the structure of $N$ when the diameter of the graph associated to the $G$-conjugacy classes contained in $N$ is as large as possible, that is, is equal to three.
Let $S$ be a subring of a finite ring $R$ and $C_R(S) = \{r \in R : rs = sr \;\forall\; s \in S\}$. The relative non-commuting graph of the subring $S$ in $R$, denoted by $\Gamma_{S, R}$, is a simple undirected graph whose vertex set is $R…
Let $S, K$ be two subrings of a finite ring $R$. Then the generalized non-commuting graph of subrings $S, K$ of $R$, denoted by $\Gamma_{S, K}$, is a simple graph whose vertex set is $(S \cup K) \setminus (C_K(S) \cup C_S(K))$ and two…
Given a finite group $G$, the Engel graph of $G$ is a directed graph $\Gamma(G)$ encoding pairs of elements satisfying some Engel word. Namely, $\Gamma(G)$ is the directed graph, where the vertices are the non-hypercentral elements of $G$…
Edge ideals of finite simple graphs $G$ on $n$ vertices are the ideals $I(G)$ of the polynomial ring $S$ in $n$ variables generated by the quadratic monomials associated with the edges of $G$. In this paper, we consider the possible pairs…
Let R be a commutative ring with identity and M be an R-module. In this paper, we introduce and investigate the second submodule intersection graph SSI(M) of M with vertices are nonzero proper submodules of M and two distinct vertices N and…
The two graphs of the title both have vertex set G. In the intersection power graph, x and y are joined if some non-identity element is a power of both; in the power graph, x and y joined if one is a power of the other. Thus the power graph…
In this paper we introduce the graph $\Gamma_{sc}(G)$ associated with a group $G$, called the solvable conjugacy class graph (abbreviated as SCC-graph), whose vertices are the nontrivial conjugacy classes of $G$ and two distinct conjugacy…
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. In this paper we derive the Vertex and Edge…
Distance ideals generalize the Smith normal form of the distance matrix of a graph. The family of graphs with 2 trivial distance ideals contains the family of graphs whose distance matrix has at most 2 invariant factors equal to 1. Here we…
Let (R, m) be the semigroup ring associated to a numerical semigroup S. In this paper we study the property of its associated graded ring G(m) to be Complete Intersection. In particular, we introduce and characterise beta-rectangular and…
The paper answers the question posed in a joint paper by A. A. Klyachko and N. M. Luneva about the optimality of the estimate for the cost of symmetry in graphs. The original estimate says that if n vertices can be removed from a connected…
Let $G$ be a finite simple non-complete connected graph on $\{1, \ldots, n\}$ and $\kappa(G) \geq 1$ its vertex connectivity. Let $f(G)$ denote the number of free vertices of $G$ and $\mathrm{diam}(G)$ the diameter of $G$. Being motivated…
A free semigroupoid algebra is the weak operator topology closed algebra generated by the left regular representation of a directed graph. We establish lattice isomorphisms between ideals and invariant subspaces, and this leads to a…
Let $X_{2k}$ be a set of $2k$ labeled points in convex position in the plane. We consider geometric non-intersecting straight-line perfect matchings of $X_{2k}$. Two such matchings, $M$ and $M'$, are disjoint compatible if they do not have…
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…
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$ be a group. The intersection graph of cyclic subgroups of $G$, denoted by $\mathscr I_c(G)$, is a graph having all the proper cyclic subgroups of $G$ as its vertices and two distinct vertices in $\mathscr I_c(G)$ are adjacent if and…
We classify modules and rings with some specific properties of their intersection graphs. In particular, we describe rings with infinite intersection graphs containing maximal left ideals of finite degree. This answers a question raised in…