English
Related papers

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

200 papers

This paper compares the divisorial gonality of a finite graph $G$ to the divisorial gonality of the associated metric graph $\Gamma(G,\mathbb{1})$ with unit lengths. We show that $\text{dgon}(\Gamma(G,\mathbb{1}))$ is equal to the minimal…

Combinatorics · Mathematics 2021-07-07 Josse van Dobben de Bruyn , Harry Smit , Marieke van der Wegen

Godsil (1985) defined a graph to be invertible if it has a non-singular adjacency matrix whose inverse is diagonally similar to a nonnegative integral matrix; the graph defined by the last matrix is then the inverse of the original graph.…

Combinatorics · Mathematics 2018-10-30 Sona Pavlikova , Daniel Sevcovic

Let R be a commutative ring and M be an R-module. We define the large sum graph, denoted by \acute{G}(M), as a graph with the vertex set of non-large submodules of M and two distinct vertices are adjacent if and only if N + K is a non-large…

Commutative Algebra · Mathematics 2019-07-22 H. Ansari-Toroghy , F. Mahboobi-Abkenar

In this paper, replacing `equality' by 'equality almost everywhere' we modify several terms associated with the ring of measurable functions defined on a measure space $(X, \mathcal{A}, \mu)$ and thereby study the graph theoretic features…

General Mathematics · Mathematics 2023-07-07 Pratip Nandi , Atasi Deb Ray , Sudip Kumar Acharyya

Let $\Gamma(\mathbb{Z}_n[i])$ be the zero divisor graph over the ring $\mathbb{Z}_n[i]$. In this article, we study pancyclic properties of $\Gamma(\mathbb{Z}_n[i])$ and $\overline{\Gamma(\mathbb{Z}_n[i])}$ for different $n$. Also, we prove…

Combinatorics · Mathematics 2018-06-22 Ravindra Kumar , Om Prakash

Let $G$ be a group. The intersection subgroup graph of $G$ (introduced by Anderson et al. \cite{anderson}) is the simple graph $\Gamma_{S}(G)$ whose vertices are those non-trivial subgroups say $H$ of $G$ with $H\cap K=\{e\}$ for some…

Combinatorics · Mathematics 2023-08-23 Santanu Mandal , Pallabi Manna

Let $G=(V,E)$ be a simple graph. A set $I\subseteq V$ is an independent set, if no two of its members are adjacent in $G$. The $k$-independent graph of $G$, $I_k (G)$, is defined to be the graph whose vertices correspond to the independent…

Combinatorics · Mathematics 2020-01-03 Davood Fatehi , Saeid Alikhani , Abdul Jalil M. Khalaf

Let X be an algebraic toric set in a projective space over a finite field. We study the vanishing ideal, I(X), of X and show some useful degree bounds for a minimal set of generators of I(X). We give an explicit description of a set of…

Commutative Algebra · Mathematics 2015-01-12 Jorge Neves , Maria Vaz Pinto , Rafael H. Villarreal

In this paper, we are motivated by two conjectures proposed by C. Bender et al.\ in 2024, which have remained open questions. The first conjecture states that if the complemented zero-divisor graph \( G(S) \) of a commutative semigroup \( S…

Combinatorics · Mathematics 2025-06-23 Anagha Khiste , Ganesh Tarte , Vinayak Joshi

We associate a graph to a possible non-zero zero-divisor in the group algebra of a torsion-free group.

Group Theory · Mathematics 2023-05-19 Alireza Abdollahi , Zahra Taheri

For $q\in\mathbb{R}$, the $Q$-matrix $Q=Q_q$ of a connected simple graph $G=(V,E)$ is $Q_q=(q^{\partial(x,y)})_{x,y\in V}$, where $\partial$ denotes the path-length distance. Describing the set $\pi(G)$ consisting of those $q\in \mathbb{R}$…

Combinatorics · Mathematics 2023-05-09 Hajime Tanaka

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…

Combinatorics · Mathematics 2009-10-29 Mohammad A. Iranmanesh , Cheryl E. Praeger

The regular graph of ideals of the commutative ring $R$, denoted by $\Gamma_{reg}(R)$, is a graph whose vertex set is the set of all non-trivial ideals of $R$ and two distinct vertices $I$ and $J$ are adjacent if and only if either $I$…

Combinatorics · Mathematics 2015-01-05 Farzad Shaveisi

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…

Rings and Algebras · Mathematics 2016-04-14 Jutirekha Dutta , Dhiren Kumar Basnet , Rajat Kanti Nath

A graph is an instrument which is extensively utilized to model various problems in different fields. Up to date, many graphs have been developed to represent algebraic structures, particularly rings in order to study their properties. In…

Combinatorics · Mathematics 2021-02-25 Mohammad Hassan Mudaber , Nor Haniza Sarmin , Ibrahim Gambo

Our purpose is to study the family of simple undirected graphs whose toric ideal is a complete intersection from both an algorithmic and a combinatorial point of view. We obtain a polynomial time algorithm that, given a graph $G$, checks…

Commutative Algebra · Mathematics 2015-07-14 Isabel Bermejo , Ignacio García-Marco , Enrique Reyes

Let $R$ be a commutative ring with identity. The involutory Cayley graph $\mathcal{G}(R)$ of $R$ is defined as the graph whose vertex set is the set of elements of $R$, where two vertices $a$ and $b$ are adjacent exactly when $(a-b)^2=1$.…

Commutative Algebra · Mathematics 2025-08-05 Hamide Keshavarzi , Afshin Amini , Babak Amini

In this note, we define a new graph $\Gamma_d(G)$ on a finite group $G$, where $d$ is a divisor of $|G|$. The vertices of $\Gamma_d(G)$ are the subgroups of $G$ of order $d$ and two subgroups $H_1$ and $H_2$ of $G$ are said to be adjacent…

Group Theory · Mathematics 2014-02-06 Vipul Kakkar , Laxmi Kant Mishra

Let $R$ be a commutative ring with nonzero identity, and $\delta :\mathcal{I(R)}\rightarrow\mathcal{I(R)}$ be an ideal expansion where $\mathcal{I(R)}$ the set of all ideals of $R$. In this paper, we introduce the concept of…

Commutative Algebra · Mathematics 2021-03-23 Ece Yetkin Celikel , Gulsen Ulucak

A $d$-dimensional box is the cartesian product $R_i\times\cdots\times R_d$ where each $R_i$ is a closed interval on the real line. The boxicity of a graph, denoted as $box(G)$, is the minimum integer $d\geq 0$ such that $G$ is the…

Discrete Mathematics · Computer Science 2025-05-20 L. Sunil Chandran , Suraj Kumar Sahoo