Properties of chains of prime ideals in an amalgamated algebra along an ideal

Let f:A→B be a ring homomorphism and let J be an ideal of B. In this paper, we study the amalgamation of A with B along J with respect to f (denoted by A?^fJ), a construction that provides a general frame for studying the amalgamated duplication of a ring along an ideal, introduced and studied by D’Anna and Fontana in 2007, and other classical constructions (such as the A+XB[X], the A+XB?X? and the D+M constructions). In particular, we completely describe the prime spectrum of the amalgamated duplication and we give bounds for its Krull dimension.     

S-Noetherian properties on amalgamated algebras along an ideal

Let A and B   be commutative rings with identity, f:A→B$f:A\to B$ a ring homomorphism and J an ideal of B  . Then the subring A?^fJ:={(a,f(a)+j)|a∈A and j∈J}$A{?}^{f}J:=\{(a,f(a)+j)|a\in A\text{and}j\in J\}$ of A×B$A\times B$ is called the amalgamation of A with B along with J with respect to f. In this paper, we investigate a general concept of the Noetherian property, called the S  -Noetherian property which was introduced by Anderson and Dumitrescu, on the ring A?^fJ$A{?}^{f}J$ for a multiplicative subset S   of A?^fJ$A{?}^{f}J$. As particular cases of the amalgamation, we also devote to study the transfers of the S  -Noetherian property to the constructions D+(_X1,…,_Xn)E[_X1,…,_Xn]$D+(X_1,\dots ,X_n)E[X_1,\dots ,X_n]$ and D+(_X1,…,_Xn)E?_X1,…,_Xn?$D+(X_1,\dots ,X_n)E?X_1,\dots ,X_n?$ and Nagata?s idealization.     

Dominating sets of the comaximal and ideal-based zero-divisor graphs of commutative rings

Abstract

Let R be a commutative ring with nonzero identity, and let I be an ideal of R. The ideal-based zero-divisor graph of R, denoted by Γ_I (R), is the graph whose vertices are the set {x ∈ R \ I| xy ∈ I for some y∈ R \ I} and two distinct vertices x and y are adjacent if and only if xy ∈ I. Define the comaximal graph of R, denoted by CG(R), to be a graph whose vertices are the elements of R, where two distinct vertices a and b are adjacent if and only if Ra+Rb=R. A nonempty set S ? V of a graph G=(V, E) is a dominating set of G if every vertex in V is either in S or is adjacent to a vertex in S. The domination number γ(G) of G is the minimum cardinality among the dominating sets of G. The main object of this paper is to study the dominating sets and domination number of Γ_I (R) and the comaximal graph CG₂(R) \ J (R) (or CGJ (R) for short) where CG₂(R) is the subgraph of CG(R) induced on the nonunit elements of R and J (R) is the Jacobson radical of R.     

The amalgamated duplication of a ring along a multiplicative-canonical ideal

After recalling briefly the main properties of the amalgamated duplication of a ring R along an ideal I, denoted by , see M. D’Anna and M. Fontana, to appear in J. Algebra Appl., we restrict our attention to the study of the properties of , when I is a multiplicative canonical ideal of R, see W. J. Heinzer, J. A. Huckaba and I. J. Papick, Comm. Algebra. In particular, we study when every regular fractional ideal of is divisorial.     

Perfect couples of graphs

We generalize the concept of perfect graphs in terms of additivity of a functional called graph entropy. The latter is an information theoretic functional on a graphG with a probability distributionP on its vertex set. For any fixedP it is sub-additive with respect to graph union. The entropy of the complete graph equals the sum of those ofG and its complement G iffG is perfect. We generalize this recent result to characterize all the cases when the sub-additivity of graph entropy holds with equality.The research of the authors is partially supported by the Hungarian National Foundation for Scientific Research (OTKA), grant No. 1806 resp. No. 1812.     

Independence numbers of graphs and generators of ideals

This article investigates the generators of certain homogeneous ideals which are associated with graphs with bounded independence numbers. These ideals first appeared in the theory oft-designs. The main theorem suggests a new approach to the Clique Problem which isNP-complete. This theorem has a more general form in commutative algebra dealing with ideals associated with unions of linear varieties. This general theorem is stated in the article; a corollary to it generalizes Turán’s theorem on the maximum graphs with a prescribed clique number. Research supported in part by NSF Grant MCS77-03533.     

Weakly central-vertex complete graphs with applications to commutative rings

The zero-divisor graph of a commutative ring R is the graph whose vertices consist of the nonzero zero-divisors of R such that distinct vertices x and y are adjacent if and only if xy=0. In this paper, a decomposition theorem is provided to describe weakly central-vertex complete graphs of radius 1. This characterization is then applied to the class of zero-divisor graphs of commutative rings. For finite commutative rings whose zero-divisor graphs are not isomorphic to that of Z₄[X]/(X²), it is shown that weak central-vertex completeness is equivalent to the annihilator condition. Furthermore, a schema for describing zero-divisor graphs of radius 1 is provided.     

On the ring of global sections of the blowing-up along a two-generated ideal

The effective relations and the relation type of an ideal generated by two regular elements can be expressed in terms of the ring of global sections of the blowing-up along the ideal. As a consequence, we find the minimal overring where the ideal is syzygetic or of linear type.     

Strongly irreducible ideals of a commutative ring

An ideal I of a ring R is said to be strongly irreducible if for ideals J and K of R, the inclusion J∩K⊆I implies that either J⊆I or K⊆I. The relationship among the families of irreducible ideals, strongly irreducible ideals, and prime ideals of a commutative ring R is considered, and a characterization is given of the Noetherian rings which contain a non-prime strongly irreducible ideal.     

Preperfect graphs

We say that a vertexx of a graph is predominant if there exists another vertexy ofG such that either every maximum clique ofG containingy containsx or every maximum stable set containingx containsy. A graph is then called preperfect if every induced subgraph has a predominant vertex. We show that preperfect graphs are perfect, and that several well-known classes of perfect graphs are preperfect. We also derive a new characterization of perfect graphs.     

Hadwiger's conjecture forK 6-free graphs

In 1943, Hadwiger made the conjecture that every loopless graph not contractible to the complete graph ont+1 vertices ist-colourable. Whent3 this is easy, and whent=4, Wagner's theorem of 1937 shows the conjecture to be equivalent to the four-colour conjecture (the 4CC). However, whent5 it has remained open. Here we show that whent=5 it is also equivalent to the 4CC. More precisely, we show (without assuming the 4CC) that every minimal counterexample to Hadwiger's conjecture whent=5 is apex, that is, it consists of a planar graph with one additional vertex. Consequently, the 4CC implies Hadwiger's conjecture whent=5, because it implies that apex graphs are 5-colourable.Research partially supported by NSF grants number DMS 8903132, and DMS 9103480 respectively. Both authors were also partially supported by the DIMACS Center at Rutgers University, and the research was carried out partially under a consulting agreement with Bellcore.     

A characterization of graphs with rank 4

The rank of a graph G is defined to be the rank of its adjacency matrix. In this paper, we consider the following problem: What is the structure of a connected graph with rank 4? This question has not yet been fully answered in the literature, and only some partial results are known. In this paper we resolve this question by completely characterizing graphs G whose adjacency matrix has rank 4.     

Zero-divisor graphs of idealizations

We consider zero-divisor graphs of idealizations of commutative rings. Specifically, we look at the preservation, or lack thereof, of the diameter and girth of the zero-divisor graph of a ring when extending to idealizations of the ring.     

Artinian ring and amalgamated algebra along an ideal

Let R and S be two commutative rings with unity, let I be an ideal of S and $$varphi : R longrightarrow S$$ be a ring homomorphism. In this paper, we give a characterization for the the amalgamated algebra $$R bowtie ^varphi I$$ to be an Artinian ring.     

A note on perfect graphs

Let the lines of a complete graph be 3-colored so that no triangle gets 3 different colors. If two of these colors form perfect graphs then so does the third.     

On unimodular graphs

We study graphs whose adjacency matrices have determinant equal to 1 or −1, and characterize certain subclasses of these graphs. Graphs whose adjacency matrices are totally unimodular are also characterized. For bipartite graphs having a unique perfect matching, we provide a formula for the inverse of the corresponding adjacency matrix, and address the problem of when that inverse is diagonally similar to a nonnegative matrix. Special attention is paid to the case that such a graph is unicyclic.     

On kernels in perfect graphs

A kernel of a digraphD is a set of vertices which is both independent and absorbant. In 1983, C. Berge and P. Duchet conjectured that an undirected graphG is perfect if and only if the following condition is fulfilled: ifD is an orientation ofG (where pairs of opposite arcs are allowed) and if every clique ofD has a kernel thenD has a kernel. We prove here the conjecture for the complements of strongly perfect graphs and establish that a minimal counterexample to the conjecture is not a complete join of an independent set with another graph.     

2–3 graphs which have Vizing's adjacency property

2–3 graphs in which each vertex is adjacent to at least two vertices of degree 3 are shown to be characterised by the number of vertices of degree 3 adjacent to vertices of degree 3 only.     

Heterochromatic tree partition numbers for complete bipartite graphs

An r-edge-coloring of a graph G is a surjective assignment of r colors to the edges of G. A heterochromatic tree is an edge-colored tree in which any two edges have different colors. The heterochromatic tree partition number of an r-edge-colored graph G, denoted by t_r(G), is the minimum positive integer p such that whenever the edges of the graph G are colored with r colors, the vertices of G can be covered by at most p vertex-disjoint heterochromatic trees. In this paper we give an explicit formula for the heterochromatic tree partition number of an r-edge-colored complete bipartite graph K_m,n.     

Vertex decomposability and regularity of very well-covered graphs

A graph is called very well-covered if it is unmixed without isolated vertices such that the cardinality of each minimal vertex cover is half the number of vertices. We first prove that a very well-covered graph is Cohen-Macaulay if and only if it is vertex decomposable. Next, we show that the Castelnuovo-Mumford regularity of the quotient ring of the edge ideal of a very well-covered graph is equal to the maximum number of pairwise 3-disjoint edges.