English
Related papers

Related papers: The annihilating-submodule graph of modules over c…

200 papers

For a class $\mathcal{G}$ of graphs, the objective of \textsc{Subgraph Complementation to} $\mathcal{G}$ is to find whether there exists a subset $S$ of vertices of the input graph $G$ such that modifying $G$ by complementing the subgraph…

Data Structures and Algorithms · Computer Science 2023-03-29 Dhanyamol Antony , Sagartanu Pal , R. B. Sandeep

Let R be a finite commutative ring with unity, and let G = (V, E) be a simple graph. The zero-divisor graph, denoted by {\Gamma}(R) is a simple graph with vertex set as R, and two vertices x, y \in R are adjacent in {\Gamma}(R) if and only…

Combinatorics · Mathematics 2023-03-14 Rameez Raja , Samir Ahmad Wagay

A set $Z$ of vertices of a graph $G$ is a zero forcing set of $G$ if initially labeling all vertices in $Z$ with $1$ and all remaining vertices of $G$ with $0$, and then, iteratively and as long as possible, changing the label of some…

Combinatorics · Mathematics 2016-08-03 Michael Gentner , Dieter Rautenbach

In this paper we study zero--divisor graphs of rings and semirings. We show that all zero--divisor graphs of (possibly noncommutative) semirings are connected and have diameter less than or equal to 3. We characterize all acyclic…

Rings and Algebras · Mathematics 2011-05-23 David Dolžan , Polona Oblak

We introduce a similarity relation between submodules of a module $M$ over a ring $R$, extending the classical notion of similarity for right ideals. Focusing on (faithfully) projective modules, we establish a sharp lower bound for the…

Rings and Algebras · Mathematics 2026-04-07 Alborz Azarang

Let $A$ be a commutative ring with identity. A proper submodule $N$ of $A$-module $M$ is said to be prime submodule if $ax \in N$ where $a \in A, x \in M$, implies $x \in N$ or $aM \subseteq N$. A proper submodule $N \subset M$ is said to…

Commutative Algebra · Mathematics 2025-04-03 Gürsel Yeşilot , Esra Tarakcı , Yasemin Şimşek

In this paper, all rings are commutative with nonzero identity. Let $M$ be an $R$-module. A proper submodule $N$ of $M$ is called a classical prime submodule, if for each $m\in M$ and elements $a,b\in R$, $abm\in N$ implies that $am\in N$…

Commutative Algebra · Mathematics 2015-08-03 Hojjat Mostafanasab , Esra Sengelen Sevim , Sakineh Babaei , Unsal Tekir

We construct examples of bounded below, noncontractible, acyclic complexes of finitely generated projective modules over some rings $S$, as well as bounded above, noncontractible, acyclic complexes of injective modules. The rings $S$ are…

Rings and Algebras · Mathematics 2024-05-06 Leonid Positselski

Let $R$ be a commutative ring with unity. The prime ideal sum graph of the ring $R$ is a simple undirected graph whose vertex set is the set of nonzero proper ideals of $R$ and two distinct vertices $I$ and $J$ are adjacent if and only if…

Combinatorics · Mathematics 2023-08-09 Praveen Mathil , Jitender Kumar

Let G be a noncyclic group of order 4, and let K be the ring Z of rational integers, the localization of Z at the prime 2 and the ring of 2-adic integers, respectively. We describe, up to conjugacy, all of the indecomposable subgroups in…

Representation Theory · Mathematics 2007-05-23 V. A. Bovdi , V. P. Rudko

The codegree of an irreducible character $\chi$ of a finite group $G$ is defined as $|G:\ker\chi|/\chi(1)$. The codegree graph $\Gamma(G)$ of a finite group $G$ is the graph whose vertices are the prime divisors of $|G|$, where two distinct…

Group Theory · Mathematics 2025-10-20 Jiyong Chen , Ni Du , Leyi Li

While a number of bounds are known on the zero forcing number $Z(G)$ of a graph $G$ expressed in terms of the order of a graph and maximum or minimum degree, we present two bounds that are related to the (upper) total domination number…

Combinatorics · Mathematics 2023-10-12 Boštjan Brešar , María Gracia Cornet , Tanja Dravec , Michael Henning

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

The cyclic subgroup graph ${\Gamma(G)}$ of a group $G$ is the simple undirected graph with cyclic subgroups as a vertex set and two distinct vertices $H_1$ and $H_2$ are adjacent if and only if $H_1 \leq H_2$ and there does not exist any…

Combinatorics · Mathematics 2025-03-18 Siddharth Malviy , Vipul Kakkar , Swapnil Srivastava

A graph $G$ is called a sum graph if there is a so-called sum labeling of $G$, i.e. an injective function $\ell: V(G) \rightarrow \mathbb{N}$ such that for every $u,v\in V(G)$ it holds that $uv\in E(G)$ if and only if there exists a vertex…

Discrete Mathematics · Computer Science 2017-08-03 Matěj Konečný , Stanislav Kučera , Jana Novotná , Jakub Pekárek , Štěpán Šimsa , Martin Töpfer

In this paper we determine, under some mild restrictions, the lattice of submodules $\gL$ of a module $M$ all of whose composition factors have multiplicity one. Such a lattice is distributive, and hence determined by its poset of down-sets…

Representation Theory · Mathematics 2013-10-16 Ian M. Musson

Let $G$ be a simple graph on $n$ vertices. Let $H$ be either the complete graph $K_m$ or the complete bipartite graph $K_{r,s}$ on a subset of the vertices in $G$. We show that $G$ contains $H$ as a subgraph if and only if…

Commutative Algebra · Mathematics 2015-10-16 Huy Tai Ha , Duc Ho

Let $g$ be a semisimple Lie algebra over $\mathbb C$ and $k$ be a reductive in $g$ subalgebra. We say that a simple $g$-module $M$ is a $(g; k)$-module if as a $k$-module $M$ is a direct sum of finite-dimensional $k$-modules. We say that a…

Representation Theory · Mathematics 2016-11-25 Alexey Petukhov

Let $G$ be a group. \textit{The permutability graph of cyclic subgroups of $G$}, denoted by $\Gamma_c(G)$, is a graph with all the proper cyclic subgroups of $G$ as its vertices and two distinct vertices in $\Gamma_c(G)$ are adjacent if and…

Group Theory · Mathematics 2015-04-06 R. Rajkumar , P. Devi

For any graph $G=(V,E)$, a subset $S\subseteq V$ \emph{dominates} $G$ if all vertices are contained in the closed neighborhood of $S$, that is $N[S]=V$. The minimum cardinality over all such $S$ is called the domination number, written…

Combinatorics · Mathematics 2011-09-19 Elliot Krop
‹ Prev 1 8 9 10 Next ›