English

Let R be a commutative ring, with 𝔸(R) its set of ideals with nonzero annihilator. In this paper and its sequel, we introduce and investigate the annihilating-ideal graph of R, denoted by 𝔸𝔾(R). It is the (undirected) graph with vertices 𝔸(R)* ≔ 𝔸(R)\{(0)}, and two distinct vertices I and J are adjacent if and only if IJ = (0). First, we study some finiteness conditions of 𝔸𝔾(R). For instance, it is shown that if R is not a domain, then 𝔸𝔾(R) has ascending chain condition (respectively, descending chain condition) on vertices if and only if R is Noetherian (respectively, Artinian). Moreover, the set of vertices of 𝔸𝔾(R) and the set of nonzero proper ideals of R have the same cardinality when R is either an Artinian or a decomposable ring. This yields for a ring R, 𝔸𝔾(R) has n vertices (n ≥ 1) if and only if R has only n nonzero proper ideals. Next, we study the connectivity of 𝔸𝔾(R). It is shown that 𝔸𝔾(R) is a connected graph and diam (𝔸𝔾)(R) ≤ 3 and if 𝔸𝔾(R) contains a cycle, then gr (𝔸𝔾(R)) ≤ 4. Also, rings R for which the graph 𝔸𝔾(R) is complete or star, are characterized, as well as rings R for which every vertex of 𝔸𝔾(R) is a prime (or maximal) ideal. In Part II we shall study the diameter and coloring of annihilating-ideal graphs.

On the coloring of the annihilating-ideal graph of a commutative ring

Let R be a commutative ring with identity and A(R) be the set of ideals with nonzero annihilator. The annihilating-ideal graph of R is defined as the graph AG(R) with the vertex set A(R)* = A(R)\{0} and two distinct vertices I and J are adjacent if and only if IJ = 0. In this paper, we study the domination number of AG(R) and some connections between the domination numbers of annihilating-ideal graphs and zero-divisor graphs are given.

Let$R$be a commutative ring. The regular digraph of ideals of$R$, denoted by$\Gamma (R)$, is a digraph whose vertex set is the set of all nontrivial ideals of$R$and, for every two distinct vertices$I$and$J$, there is an arc from$I$to$J$whenever$I$contains a nonzero divisor on$J$. In this paper, we study the connectedness of$\Gamma (R)$. We also completely characterise the diameter of this graph and determine the number of edges in$\Gamma (R)$, whenever$R$is a finite direct product of fields. Among other things, we prove that$R$has a finite number of ideals if and only if$\mathrm {N}_{\Gamma (R)}(I)$is finite, for all vertices$I$in$\Gamma (R)$, where$\mathrm {N}_{\Gamma (R)}(I)$is the set of all adjacent vertices to$I$in$\Gamma (R)$.

Let R be a commutative ring with identity and $$\mathbb {A}(R)$$ be the set of all annihilator ideals of R. The annihilator-ideal graph of R, denoted by $$A_I(R)$$ , is a simple graph with the vertex set $$\mathbb {A}^*(R) := \mathbb {A}(R)\setminus \{(0)\}$$ , and two distinct vertices I and J are adjacent if and only if $$ann(IJ)\ne ann(I) \cup ann(J)$$ . In this paper, we characterize all isomorphism classes of Artinian commutative rings whose $$A_I(R)$$ has genus one and crosscap one.

Covering projective planar graphs with three forests

Let R be a ring with unity and I(R)∗ are all non-trivial left ideals of R. The intersection graph of ideals of R is denoted by G(R) is an undirected simple graph with vertex set I(R)∗ and two distinct vertices I and J are adjacent if and only if I∩J ≠ 0. In this article, we investigate some basic properties of the line graph associated to G(R), denoted by L(G(R)). Moreover, we investigate completeness, unicyclicness, bipartiteness, planarity, outerplanarity, ring graph, diameter, girth and clique of L(G(Zn)). We also investigate some basic properties of L(G(R)) for left Artinian ring and finally, we determine the domination number and bondage number of L(G(Zn)).

Let [Formula: see text] be a commutative ring with identity and [Formula: see text] be the set of all nonzero zero-divisors of [Formula: see text]. The annihilator graph of commutative ring [Formula: see text] is the simple undirected graph AG([Formula: see text]) with vertices [Formula: see text] and two distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if [Formula: see text] The essential graph of [Formula: see text] is defined as the graph [Formula: see text] with the vertex set [Formula: see text] and two distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if [Formula: see text] is an essential ideal. In this paper, we classify all finite commutative rings with identity whose annihilator graph and essential graph have crosscap two.

Let R be a ring. The prime intersection graph of ideals of R, denoted by $$G_{P}(R)$$ , is the graph whose vertex set is the collection of all non-trivial (left) ideals of R with two distinct vertices I and J are adjacent if and only if $$I\cap J\ne 0$$ and either one of I or J is a prime ideal of R. We discuss connectedness in $$G_{P}(R)$$ . The concepts of bipartition, planarity and colorability are interpreted. Finally, we introduce the idea of traversability in $$G_{P}({\mathbb {Z}}_n)$$ . The core part of this paper is observed in the ring $${\mathbb {Z}}_n$$ .

Harmonic analysis of boxed hyperoctahedral Hall-Littlewood polynomials

Spectra of quasi-strongly regular graphs

For a non-negative integer r, the r-orbit of a vertex v in a connected graph G of order n is the set of vertices at distance r from v. A sequence of positive integers with is called an irregular orbital dominating sequence of G if for every pair i, j of integers with and G contains distinct vertices such that We investigate graphs that possess and graphs do not possess an irregular orbital dominating sequence. It is shown that a non-trivial tree has an irregular orbital dominating sequence if and only if it is neither a star, a path of order 2, nor a path of order 6.

For an undirected graph $$G=(V,E)$$G=(V,E), a vertex $$\tau \in V$$źźV separates vertices u and v (where $$u,v\in V$$u,vźV, $$u\ne v$$uźv) if their distances to $$\tau $$ź are not equal. Given an integer parameter $$k \ge 1$$kź1, a set of vertices $$L\subseteq V$$L⊆V is a feasible solution, if for every pair of distinct vertices, u, v, there are at least k distinct vertices $$\tau _{1},\tau _{2},\ldots ,\tau _{k}\in L$$ź1,ź2,ź,źkźL, each separating u and v. Such a feasible solution is called a landmark set, and the k-metric dimension of a graph is the minimal cardinality of a landmark set for the parameter k. The case $$k=1$$k=1 is a classic problem, where in its weighted version, each vertex v has a non-negative cost, and the goal is to find a landmark set with minimal total cost. We generalize the problem for $$k \ge 2$$kź2, introducing two models, and we seek for solutions to both the weighted version and the unweighted version of this more general problem. In the model of all-pairs (AP), k separations are needed for every pair of distinct vertices of V, while in the non-landmarks model (NL), such separations are required only for pairs of distinct vertices in $$V \setminus L$$V\L. We study the weighted and unweighted versions for both models (AP and NL), for path graphs, complete graphs, complete bipartite graphs, and complete wheel graphs, for all values of $$k \ge 2$$kź2. We present algorithms for these cases, thus demonstrating the difference between the two new models, and the differences between the cases $$k=1$$k=1 and $$k \ge 2$$kź2.

A set of vertices and edges forms a graph. A graph can be associated with groups using the groups' properties for its vertices and edges. The set of vertices of the graph comprises the elements of the group, while the set of edges of the graph is the properties and requirements for the graph. A non-abelian tensor square graph of a group is defined when its vertex set represents the non-tensor centre elements' set of G. Then, two distinguished vertices are connected by an edge if and only if the non-abelian tensor square of these two elements is not equal to the identity of the non-abelian tensor square. This study investigates the non-abelian tensor square graph for the symmetric group of order six. In addition, some properties of this group's non-abelian tensor square graph are computed, including the diameter, the dominating number, and the chromatic number. The perfect code for the non-abelian tensor square graph for a symmetric group of order six is also found in this paper.

Let R be a commutative ring and Z(R) be its set of all zero-divisors. Anderson and Badawi [The total graph of a commutative ring, J. Algebra320 (2008) 2706–2719] introduced the total graph of R, denoted by TΓ(R), as the undirected graph with vertex set R, and two distinct vertices x and y are adjacent if and only if x + y ∈ Z(R). Tamizh Chelvam and Asir [Domination in the total graph of a commutative ring, to appear in J. Combin. Math. Combin. Comput.] obtained the domination number of the total graph and studied certain other domination parameters of TΓ(R) where R is a commutative Artin ring. The intersection graph of gamma sets in TΓ(R) is denoted by ITΓ(R). Tamizh Chelvam and Asir [Intersection graph of gamma sets in the total graph, Discuss. Math. Graph Theory32 (2012) 339–354, doi:10.7151/dmgt.1611] initiated a study about the intersection graph ITΓ (ℤn) of gamma sets in TΓ(ℤn). In this paper, we study about ITΓ(R), where R is a commutative Artin ring. Actually we investigate the interplay between graph-theoretic properties of ITΓ(R) and ring-theoretic properties of R. At the first instance, we prove that diam (ITΓ(R)) ≤ 2 and gr (ITΓ(R)) ≤ 4. Also some characterization results regarding completeness, bipartite, cycle and chordal nature of ITΓ(R) are given. Further, we discuss about the vertex-transitive property of ITΓ(R). At last, we obtain all commutative Artin rings R for which ITΓ(R) is either planar or toroidal or genus two.