On the Nonorientable Genus of the Generalized Unit and Unitary Cayley Graphs of a Commutative Ring

Let [Formula: see text] be a commutative ring and [Formula: see text] the multiplicative group of unit elements of [Formula: see text]. In 2012, Khashyarmanesh et al. defined the generalized unit and unitary Cayley graph, [Formula: see text], corresponding to a multiplicative subgroup [Formula: see text] of [Formula: see text] and a nonempty subset [Formula: see text] of [Formula: see text] with [Formula: see text], as the graph with vertex set [Formula: see text]and two distinct vertices [Formula: see text] and [Formula: see text] being adjacent if and only if there exists [Formula: see text] such that [Formula: see text]. In this paper, we characterize all Artinian rings [Formula: see text] for which [Formula: see text] is projective. This leads us to determine all Artinian rings whose unit graphs, unitary Cayley graphs and co-maximal graphs are projective. In addition, we prove that for an Artinian ring [Formula: see text] for which [Formula: see text] has finite nonorientable genus, [Formula: see text] must be a finite ring. Finally, it is proved that for a given positive integer [Formula: see text], the number of finite rings [Formula: see text] for which [Formula: see text] has nonorientable genus [Formula: see text] is finite.

On a spanning subgraph of the annihilating-ideal graph of a commutative ring

The rings considered in this paper are commutative with identity which are not integral domains. Let [Formula: see text] be a ring. Let us denote the set of all annihilating ideals of [Formula: see text] by [Formula: see text] and [Formula: see text] by [Formula: see text]. With [Formula: see text], we associate an undirected graph, denoted by [Formula: see text], whose vertex set is [Formula: see text] and distinct vertices [Formula: see text] and [Formula: see text] are adjacent in this graph if and only if [Formula: see text] and [Formula: see text]. The aim of this paper is to study the interplay between the graph-theoretic properties of [Formula: see text] and the ring-theoretic properties of [Formula: see text].

Regularity of extended conjugate graphs of finite groups

<abstract><p>The extended conjugate graph associated to a finite group $ G $ is defined as an undirected graph with vertex set $ G $ such that two distinct vertices joined by an edge if they are conjugate. In this article, we show that several properties of finite groups can be expressed in terms of properties of their extended conjugate graphs. In particular, we show that there is a strong connection between a graph-theoretic property, namely regularity, and an algebraic property, namely nilpotency. We then give some sufficient conditions and necessary conditions for the non-central part of an extended conjugate graph to be regular. Finally, we study extended conjugate graphs associated to groups of order $ pq $, $ p^3 $, and $ p^4 $, where $ p $ and $ q $ are distinct primes.</p></abstract>

Fault-Tolerant Metric Dimension of Circulant Graphs

Let G be a connected graph with vertex set V(G) and d(u,v) be the distance between the vertices u and v. A set of vertices S={s1,s2,…,sk}⊂V(G) is called a resolving set for G if, for any two distinct vertices u,v∈V(G), there is a vertex si∈S such that d(u,si)≠d(v,si). A resolving set S for G is fault-tolerant if S\{x} is also a resolving set, for each x in S, and the fault-tolerant metric dimension of G, denoted by β′(G), is the minimum cardinality of such a set. The paper of Basak et al. on fault-tolerant metric dimension of circulant graphs Cn(1,2,3) has determined the exact value of β′(Cn(1,2,3)). In this article, we extend the results of Basak et al. to the graph Cn(1,2,3,4) and obtain the exact value of β′(Cn(1,2,3,4)) for all n≥22.

The Intersection Graph of Subgroups of the Dihedral Group of Order 2pq

For a finite group G, the intersection graph of G is the graph whose vertex set is the set of all proper non-trivial subgroups of G, where two distinct vertices are adjacent if their intersection is a non-trivial subgroup of G. In this article, we investigate the detour index, eccentric connectivity, and total eccentricity polynomials of the intersection graph of subgroups of the dihedral group for distinct primes . We also find the mean distance of the graph .

The knapsack problem with special neighbor constraints

The knapsack problem is one of the simplest and most fundamental NP-hard problems in combinatorial optimization. We consider two knapsack problems which contain additional constraints in the form of directed graphs whose vertex set corresponds to the item set. In the one-neighbor knapsack problem, an item can be chosen only if at least one of its neighbors is chosen. In the all-neighbors knapsack problem, an item can be chosen only if all its neighbors are chosen. For both problems, we consider uniform and general profits and weights. We prove upper bounds for the time complexity of these problems when restricting the graph constraints to special sets of digraphs. We discuss directed co-graphs, minimal series-parallel digraphs, and directed trees.

Integral Mixed Cayley Graphs over Abelian Groups

A mixed graph is said to be integral if all the eigenvalues of its Hermitian adjacency matrix are integer. Let $\Gamma$ be an abelian group. The mixed Cayley graph $Cay(\Gamma,S)$ is a mixed graph on the vertex set $\Gamma$ and edge set $\left\{ (a,b): b-a\in S \right\}$, where $0\not\in S$. We characterize integral mixed Cayley graph $Cay(\Gamma,S)$ over an abelian group $\Gamma$ in terms of its connection set $S$.

The Generalized Connectivity of Generalized Petersen Graph

For a vertex set [Formula: see text] of [Formula: see text], we use [Formula: see text] to denote the maximum number of edge-disjoint Steiner trees of [Formula: see text] such that any two of such trees intersect in [Formula: see text]. The generalized [Formula: see text]-connectivity of [Formula: see text] is defined as [Formula: see text]. We get that for any generalized Petersen graph [Formula: see text] with [Formula: see text], [Formula: see text] when [Formula: see text]. We give the values of [Formula: see text] for Petersen graph [Formula: see text], where [Formula: see text], and the values of [Formula: see text] for generalized Petersen graph [Formula: see text], where [Formula: see text] and [Formula: see text].

On g-Noncommuting Graph of a Finite Group Relative to Its Subgroups

Let H be a subgroup of a finite non-abelian group G and g∈G. Let Z(H,G)={x∈H:xy=yx,∀y∈G}. We introduce the graph ΔH,Gg whose vertex set is G\Z(H,G) and two distinct vertices x and y are adjacent if x∈H or y∈H and [x,y]≠g,g−1, where [x,y]=x−1y−1xy. In this paper, we determine whether ΔH,Gg is a tree among other results. We also discuss about its diameter and connectivity with special attention to the dihedral groups.