Related papers: Nearly Gorenstein rings arising from finite graphs
A partial complement of the graph $G$ is a graph obtained from $G$ by complementing all the edges in one of its induced subgraphs. We study the following algorithmic question: for a given graph $G$ and graph class $\mathcal{G}$, is there a…
For each infinite word over a given finite alphabet, we define an increasing sequence of rooted finite graphs, that can be thought as approximations of the famous Sierpinski carpet. These sequences naturally converge to an infinite rooted…
A classification is given for factorizations of almost simple groups with at least one factor solvable, and it is then applied to characterize $s$-arc-transitive Cayley graphs of solvable groups, leading to a striking corollary: Except the…
A dominating set in a graph $G$ is a set $S$ of vertices such that every vertex of $G$ is either in $S$ or is adjacent to a vertex in $S$. Nordhaus-Gaddum inequailties relate a graph $G$ to its complement $\bar{G}$. In this spirit Wagner…
The question of when the Rees algebra ${\mathcal R} (I)= \bigoplus_{n \ge 0}I^n$ of $I$ is an almost Gorenstein graded ring is explored, where $R$ is a two-dimensional regular local ring and $I$ a contracted ideal of $R$. It is known that…
T.C. Burness and S.D. Scott \cite{3} classified finite groups $G$ such that the number of prime order subgroups of $G$ is greater than $|G|/2-1$. In this note, we study finite groups $G$ whose subgroup graph contains a vertex of degree…
A totally silver coloring of a graph G is a k--coloring of G such that for every vertex v \in V(G), each color appears exactly once on N[v], the closed neighborhood of v. A totally silver graph is a graph which admits a totally silver…
In this paper we study generalized Gorenstein Arf rings; a class of one-dimensional Cohen-Macaulay local Arf rings that is strictly contained in the class of Gorenstein rings. We obtain new characterizations and examples of Arf rings, and…
We classify the far-flung Gorenstein numerical semigroup rings of type 4.
It is known that complete graphs and complete multipartite graphs have modularity zero. We show that the least number of edges we may delete from the complete graph $K_n$ to obtain a graph with non-zero modularity is $\lfloor n/2\rfloor…
Relations between Gorenstein derived categories, Gorenstein defect categories and Gorenstein stable categories are established. Using these, the Gorensteinness of an algebra $A$ and invariants with respect to recollements of the bounded…
We prove that two-sided tilting complexes, and dualizing complexes, over simple Goldie rings (with some technical conditions) are always shifts of invertible bimodules. This allows us to describe the derived Picard groups of such rings, and…
In this paper we study prime graphs of finite groups. The prime graph of a finite group $G$, also known as the Gruenberg-Kegel graph, is the graph with vertex set {primes dividing $|G|$} and an edge $p$-$q$ if and only if there exists an…
We study how many comparability subgraphs are needed to partition the edge set of a perfect graph. We show that many classes of perfect graphs can be partitioned into (at most) two comparability subgraphs and this holds for almost all…
We study the class of 1-perfectly orientable graphs, that is, graphs having an orientation in which every out-neighborhood induces a tournament. 1-perfectly orientable graphs form a common generalization of chordal graphs and circular arc…
Recently, nearly complete intersection ideals were defined by Boocher and Seiner to establish lower bounds on Betti numbers for monomial ideals (arXiv:1706.09866). Stone and Miller then characterized nearly complete intersections using the…
Motivated by pseudo-Gorenstein rings in commutative algebra, introduced by Herzog et al., we define pseudo-Gorenstein$^{*}$ graphs and classify them in several natural graph families using independence polynomials.
As part of stratification of Cohen-Macaulay rings, we introduce and develop the theory of Goto rings, generalizing the notion of almost Gorenstein rings originally defined by V. Barucci and R. Fr\"oberg in 1997. What has dominated the…
Let $\alpha=\alpha(G)$ be the independence number of a simple graph $G$ with $n$ vertices and $I(G)$ be its edge ideal in $S=K[x_1,\ldots, x_n]$. If $S/I(G)$ is Gorenstein, the graph $G$ is called Gorenstein over $K$ and if $G$ is…
The nearly complete bipartite graph $G(m,n,k)$ is obtained by removing $k$ independent edges from the complete bipartite graph $K_{m,n}$. In this paper, we prove that for any nearly complete bipartite graph $G(m,n,k)$ with $m, n\geq 3$, and…