Related papers: Pancyclic zero divisor graph over the ring $\mathb…

We associate a graph $\Gamma_G$ to a non locally cyclic group $G$ (called the non-cyclic graph of $G$) as follows: take $G\backslash Cyc(G)$ as vertex set, where $Cyc(G)=\{x\in G | \left<x,y\right> \text{is cyclic for all} y\in G\}$, and…

Let $R$ be a commutative ring and $I$ be an ideal of $R$. The amalgamated duplication of $R$ along $I$ is the subring $R\Join I:=\{(r,r+i)| r\in R, i\in I\}$ of $R\times R$. This paper investigates the extended zero-divisor graph of the…

A Berge cycle of length $\ell$ in a hypergraph is an alternating sequence of $\ell$ distinct vertices and $\ell$ distinct edges $v_1,e_1,v_2, \ldots, v_\ell, e_{\ell}$ such that $\{v_i, v_{i+1}\} \subseteq e_i$ for all $i$, with indices…

Let $G_1,...,G_n$ be graphs on the same vertex set of size $n$, each graph with minimum degree $\delta(G_i)\ge n/2$. A recent conjecture of Aharoni asserts that there exists a rainbow Hamiltonian cycle i.e. a cycle with edge set…

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…

The proper divisor graph $\Upsilon_n$ of a positive integer $n$ is the simple graph whose vertices are the proper divisors of $n$, and in which two distinct vertices $u, v$ are adjacent if and only if $n$ divides $uv$. The graph…

Given a graph whose edges are labeled by ideals in a ring, a generalized spline is a labeling of each vertex by a ring element so that adjacent vertices differ by an element of the ideal associated to the edge. We study splines over the…

Let $\Gamma$ be a simple graph with $n$ vertices. The energy of $\Gamma$, denoted by $\mathcal{E}(\Gamma)$, is defined as the sum of the absolute values of the eigenvalues of $\Gamma$. The graph $\Gamma$ is said to be hyperenergetic if…

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…

The power graph $\Gamma_G$ of a finite group $G$ is the graph with the vertex set $G$, where two distinct elements are adjacent if one is a power of the other. An $L(2, 1)$-labeling of a graph $\Gamma$ is an assignment of labels from…

For a commutative semigroup $S$ with 0, the zero-divisor graph of $S$ denoted by $\Gamma(S)$ is the graph whose vertices are nonzero zero-divisor of $S$, and two vertices $x$, $y$ are adjacent in case $xy=0$ in $S$. In this paper we study…

The commuting graph of a group G, denoted by Gamma(G), is the simple undirected graph whose vertices are the non-central elements of G and two distinct vertices are adjacent if and only if they commute. Let Z_m be the commutative ring of…

A graph on n vertices is called pancyclic if it contains a cycle of length l for all 3 \le l \le n. In 1972, Erdos proved that if G is a Hamiltonian graph on n > 4k^4 vertices with independence number k, then G is pancyclic. He then…

We show that for certain integers $n$, the problem of whether or not a Cayley digraph $\Gamma$ of $\mathbb Z_n$ is also isomorphic to a Cayley digraph of some other abelian group $G$ of order $n$ reduces to the question of whether or not a…

Let $G$ be a graph, $\chi(G)$ be the minimal number of colors which can be assigned to the vertices of $G$ in such a way that every two adjacent vertices have different colors and $\omega(G)$ to be the least upper bound of the size of the…

The non-commuting graph $\Gamma_R$ of a finite ring $R$ with center $Z(R)$ is a simple undirected graph whose vertex set is $R \setminus Z(R)$ and two distinct vertices $a$ and $b$ are adjacent if and only if $ab \ne ba$. In this paper, we…

In a recent paper, Grau et al. (2017) studied the zero divisor graphs of the ring of Lipschitz integers modulo $n$, and computed the domination number of the undirected zero divisor graph of the ring of Lipschitz integers modulo $n$. But…

The \textit{boxicity} (\textit{cubicity}) of an undirected graph $\Gamma$ is the smallest non-negative integer $k$ such that $\Gamma$ can be represented as the intersection graph of axis-parallel rectangular boxes (unit cubes) in…

The paper systematically classifies rings based on the dominant metric dimensions (Ddim) of their associated CZDG, establishing consequential bounds for the Ddim of these compressed zero-divisor graphs. The authors investigate the interplay…

We associate a graph $\mathcal{C}_G$ to a non locally cyclic group $G$ (called the non-cyclic graph of $G$) as follows: take $G\backslash Cyc(G)$ as vertex set, where $Cyc(G)=\{x\in G | < x,y> \text{is cyclic for all} y\in G\}$ is called…