English
Related papers

Related papers: Sum-Essential Graphs of Modules

200 papers

A graph $G=(V,E)$ is $\gamma$-excellent if $V$ is a union of all $\gamma$-sets of $G$, where $\gamma$ stands for the domination number. Let $\mathcal{I}$ be a set of all mutually nonisomorphic graphs and $\emptyset \not= \mathcal{H}…

Combinatorics · Mathematics 2020-10-08 Vladimir Samodivkin

In this paper, we use theory of rough set to study graphs using the concept of orbits. We investigate the indiscernibility partitions and approximations of graphs induced by orbits of graphs. We also study rough membership functions,…

Combinatorics · Mathematics 2021-04-20 Imran Javaid , Shahroz Ali , Shahid Ur Rehman , Aqsa Shah

To a simple graph we associate a so-called graph series, which can be viewed as the Hilbert--Poincar\'e series of a certain infinite jet scheme. We study new $q$-representations and examine modular properties of several examples including…

Number Theory · Mathematics 2021-05-13 Kathrin Bringmann , Chris Jennings-Shaffer , Antun Milas

A graph $G$ is a {\em chordal-$k$-generalized split graph} if $G$ is chordal and there is a clique $Q$ in $G$ such that every connected component in $G[V \setminus Q]$ has at most $k$ vertices. Thus, chordal-$1$-generalized split graphs are…

Discrete Mathematics · Computer Science 2017-04-28 Andreas Brandstädt , Raffaele Mosca

For a graph $G$, the $\gamma$-graph of $G$, $G(\gamma)$, is the graph whose vertices correspond to the minimum dominating sets of $G$, and where two vertices of $G(\gamma)$ are adjacent if and only if their corresponding dominating sets in…

Combinatorics · Mathematics 2017-07-10 C. M. Mynhardt , L. E. Teshima

The metric (resp. edge metric) dimension of a simple connected graph $G$, denoted by dim$(G)$ (resp. edim$(G)$), is the cardinality of a smallest vertex subset $S\subseteq V(G)$ for which every two distinct vertices (resp. edges) in $G$…

Combinatorics · Mathematics 2021-11-25 Enqiang Zhu , Shaoxiang Peng , Chanjuan Liu

The degree matrix of a graph is the diagonal matrix with diagonal entries equal to the degrees of the vertices of $X$. If $X_1$ and $X_2$ are graphs with respective adjacency matrices $A_1$ and $A_2$ and degree matrices $D_1$ and $D_2$, we…

Combinatorics · Mathematics 2024-07-17 Chris Godsil , Wanting Sun

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 finite group of order $ n$. The strong power graph $\mathcal{P}_s(G) $ of $G$ is the undirected graph whose vertices are the elements of $G$ such that two distinct vertices $a$ and $b$ are adjacent if $a^{{m}_1}$=$b^{{m}_2}$…

Combinatorics · Mathematics 2015-07-20 A. K. Bhuniya , S. Bera

Let $G$ be a finite group and let $k$ be an algebraically closed field of characteristic $2$ and let $M$ be an indecomposable $kG$-module which affords a non-degenerate $G$-invariant symmetric bilinear form. We introduce the symmetric…

Representation Theory · Mathematics 2016-04-21 John C. Murray

For a graph G, M(G) denotes the maximum multiplicity occurring of an eigenvalue of a symmetric matrix whose zero-nonzero pattern is given by edges of G. We introduce two combinatorial graph parameters T^-(G) and T^+(G) that give a lower and…

Combinatorics · Mathematics 2016-07-06 Keivan Hassani Monfared , Sudipta Mallik

A pseudo [2,b]-factor of a graph G is a spanning subgraph in which each component C on at least three vertices is a [2,b]-graph. The main contibution of this paper, is to give an upper bound to the number of components that are edges or…

Discrete Mathematics · Computer Science 2012-04-18 Siham Bekkai

We study the real components of modular curves. Our main result is an abstract group-theoretic description of the real components of a modular curve defined by a congruence subgroup of level N in terms of the corresponding subgroup of…

Number Theory · Mathematics 2011-08-17 Andrew Snowden

Let R be a commutative ring with unity, M a module over R and let S be a G-set for a finite group G. We define a set MS to be the set of elements expressed as the formal finite sum of the form similar to the elements of group ring RG. The…

Rings and Algebras · Mathematics 2017-01-24 Mehmet Uc , Mustafa Alkan

A set $S$ of vertices in a graph $G(V,E)$ is called a dominating set if every vertex $v\in V$ is either an element of $S$ or is adjacent to an element of $S$. A set $S$ of vertices in a graph $G(V,E)$ is called a total dominating set if…

Combinatorics · Mathematics 2008-10-28 Maryam Atapour , Nasrin Soltankhah

Assume that $G$ is a finite group. For every $a, b \in\mathbb N,$ we define a graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if…

Group Theory · Mathematics 2020-06-23 Cristina Acciarri , Andrea Lucchini

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 R be an associative ring with unity and let M be an R-module. We call M (ample) Rad-supplementing if M has a (ample) Rad-supplement in every extension. If M is Rad-supplementing, then every direct summand of M is Rad-supplementing, but…

Rings and Algebras · Mathematics 2016-10-03 Salahattin Özdemir

We consider modular graph functions that arise in the low energy expansion of the four graviton amplitude in type II string theory. The vertices of these graphs are the positions of insertions of vertex operators on the toroidal worldsheet,…

High Energy Physics - Theory · Physics 2016-12-06 Anirban Basu

In this paper we introduce and study a graph on the set of ideals of a commutative ring $R$. The vertices of this graph are non-trivial ideals of $R$ and two distinct ideals $I$ and $J$ are adjacent if and only $IJ=I\cap J$. We obtain some…

Combinatorics · Mathematics 2016-02-24 Hamid Reza Dorbidi , Saeid Alikhani