Related papers: Some graphs related to submodules of a module
Let $R$ be a commutative ring and $M$ a non-zero $R$-module. We introduce the class of \emph{pseudo strongly hollow submodules} (\emph{PS-hollow submodules}, for short) of $M$. Inspired by the theory of modules with \emph{secondary…
Let $G=(V,E)$ be a simple graph. A set $S\subseteq V$ is independent set of $G$, if no two vertices of $S$ are adjacent. The independence number $\alpha(G)$ is the size of a maximum independent set in the graph. %An independent set with…
The inclusion ideal graph of a commutative unitary ring $R$ is the (undirected) graph $In(R)$ whose vertices all non-trivial ideals of $R$ and two distinct vertices are adjacent if and only if one of them is a proper subset of the other…
We study random subcube intersection graphs, that is, graphs obtained by selecting a random collection of subcubes of a fixed hypercube $Q_d$ to serve as the vertices of the graph, and setting an edge between a pair of subcubes if their…
We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…
Given a graph $G$ whose edges are labeled by ideals of a commutative ring $R$ with identity, a generalized spline is a vertex labeling of $G$ by the elements of $R$ so that the difference of labels on adjacent vertices is an element of the…
We consider several classes of complete intersection numerical semigroups, aris- ing from many different contexts like algebraic geometry, commutative algebra, coding theory and factorization theory. In particular, we determine all the…
We call a finite undirected graph minimally k-matchable if it has at least k distinct perfect matchings but deleting any edge results in a graph which has not. An odd subdivision of some graph G is any graph obtained by replacing every edge…
The traditional adjacency matrix of a mixed graph is not symmetric in general, hence its eigenvalues may be not real. To overcome this obstacle, several authors have recently defined and studied various Hermitian adjacency matrices of…
Let R be a commutative ring with a non-zero identity. In this paper, we define a new graph, the compressed intersection annihilator graph, denoted by $IA(R)$, and investigate some of its theoretical properties and its relation with the…
In the suborbital graphs studies, there has been a research gap in the sense that the Modular group is connected to two numbers. Thus, this paper attempts to contribute to the studies developed by Gauss, Bolyai, Lobachevsky and Riemann.…
There is an established bijection between finite-index subgroups Gamma of Gamma(2) and bipartite graphs on surfaces, or, equivalently, certain triples of permutations. We utilize this relationship to study both congruence and noncongruence…
In this paper we compute the generating function of modular, $k$-noncrossing diagrams. A $k$-noncrossing diagram is called modular if it does not contains any isolated arcs and any arc has length at least four. Modular diagrams represent…
Intuitively speaking, a bipartite graph is mirror if it can be drawn in the Cartesian plane in such a way that, the vertices of one stable are points in x=0, the vertices of the other stable set are points in x=1, the edges are straight…
In this paper, we introduce the notion of uniformly S-essential (u-S-essential) submodules. Let R be a commutative ring and S a multiplicative subset of R. A submodule K of an R-module M is said to be u-S-essential in M if for any submodule…
We describe two constructions of (very) dense graphs which are edge disjoint unions of large {\em induced} matchings. The first construction exhibits graphs on $N$ vertices with ${N \choose 2}-o(N^2)$ edges, which can be decomposed into…
Grid intersection graphs are the intersection graphs of vertical and horizontal segments in the plane. When the bottom and respectively left endpoints of the vertical and horizontals segments belong to a line with negative slope, the graph…
For a given hypergraph, an orientation can be assigned to the vertex-edge incidences. This orientation is used to define the adjacency and Laplacian matrices. In addition to studying these matrices, several related structures are…
Let $R$ be a $G$ graded commutative ring and $M$ be a $G$-graded $R$-module. The set of all graded second submodules of $M$ is denoted by $Spec_G^s(M)$ and it is called the graded second spectrum of $M$. In this paper, we discuss graded…
Several generalizations of a commutative ring that is a graded complete intersection are proposed for a noncommutative graded $k$-algebra; these notions are justified by examples from noncommutative invariant theory.